Asymptotic normality of the generalized Eulerian numbers

Let A(m)(n, k) denote the number of permutations of (1,..., n) with exactly k rises of size at least m. We show that, for each positive integer m, the A(m)(n, k) are asymptotically normal.