#include <stdio.h>

 #define MAX 10009

 int prime[];

 void print(int *v, int length)

 {

     int i = ;

     for (; i < length; i++)

         printf("%d ", v[i]);

     putchar('\n');

 }

 int getPrime()

 {

     int i = , k = ;

     int j = ;

     int flag;

     prime[] = ;

     for (; i < ; i++) {

         for (flag = , j = ; j < k; j++) {

             if (i % prime[j] == ) {

                 flag = ;

                 break;

             }

         }

         if (!flag)

             prime[k++] = i;

     }

     print(prime, );

 }

 int comb(int m, int n)

 {

     int count[] = {  };

     int i = , j = ;

     int mm;

     int mul = , tmp;

     for (i = m; i > m - n; i--) {

         mm = i;

         for (j = ; mm != ; j++) {

             if (mm % prime[j] == ) {

                 mm /= prime[j];

                 ++count[j];

                 --j;

             }

         }

     }

     for (i = n; i >= ; i--) {

         mm = i;

         for (j = ; mm != ; j++)

             if (mm % prime[j] == ) {

                 mm /= prime[j];

                 --count[j];

                 --j;

             }

     }

     for (i = ; i < ; i++) {

         tmp = count[i];

         while (tmp) {

             mul = (mul * prime[i]) % MAX;

             tmp--;

         }

     }

     return mul;

 }

 int main()

 {

     getPrime();

     printf("%d\n", comb(, ));

     return ;

 }