perm

Besides his passion for numbers, Zaharel is also a big fan of permutations. Today he's decided to study only permutations of P of length N which have an interesting property: they contain K distinctive positions 1<i₁,i₂,…,i_K<=N for which P[i_k]=P[i_k-1]+1.

Task

Write a program that determines how many permutations Zaharel will study today.

Input Data

The first line of input file perm.in contains two positive integers, N and K, separated by a single space.

Output Data

Output file perm.out will contain a single line with the number of permutations that satisfy the property above. Because the result can be very large, the remainder of the result's division to number 666013 will be displayed.

Constraints

0 <= K < N <= 3000

Examples

Time limit: 0.5 seconds/test

Mircea Pasoi
University of Bucharest, Mathematics & IT Department
bogdanpasoi@yahoo.com