nyoj645

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=110;
int dp[maxn][maxn*6];
const int mod=100007;
int dfs(int n,int k){
if(n>k) return 0;
if(k>n*6) return 0;
if(dp
[k]) return dp
[k]%mod;
if(n==1 &&k<=6) return 1;
int ret=0;

for(int i=1; i<=6; i++){
ret+=dfs(n-1,k-i);
ret%=mod;
//    printf("%d\n",ret);
}
dp
[k]=ret;
return ret;
}

int main(){
memset(dp,0,sizeof(dp));
int n,k;
while(scanf("%d%d",&n,&k)!=EOF){
printf("%d\n",dfs(n,k));
}
return 0;
}