#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long LL;
LL n,m;
LL p = 10007;

LL quick_mod(LL a,LL b){
    LL ans = 1;
    a %= p;
    while (b){
        if (b & 1){
            ans = ans * a % p;
        }
        b >>= 1;
        a = a * a % p; 
    }
    return ans;
}

LL C(LL n,LL m){
    if (m > n) return 0;
    LL ans = 1;
    LL i;
    for (i=1;i<=m;i++){
        LL a = (n + i - m) % p;
        LL b = i % p;
        ans = ans * (a * quick_mod(b,p-2) % p) % p; 
    }
    return ans;
}

LL lucas(LL n,LL m){
    if (m == 0) return 1;
    return C(n % p,m % p) * lucas(n / p,m / p) % p;
} 
int main(){
    while (scanf("%lld %lld",&n,&m) != EOF){
        printf("%d\n",lucas(m,n));
    }
    return 0;
}