//d[k][n]=d[k-1][n]+d[k-1][n-1]+,,,,+d[k-1][0]
#include <iostream>
using namespace std;
#include <cstring>
int d[105][105],n;
int dfs(int k,int m)
{
int i;
if(d[k][m]!=0) return d[k][m];
for(i=0;i<=n;i++)
if(m-i>=0) d[k][m]=(d[k][m]+dfs(k-1,m-i))%1000000;
return d[k][m];
}
int main(int argc, char *argv[])
{
int i,k;
while(cin>>n>>k&&(n||k))
{
memset(d,0,sizeof(d));
for(i=0;i<=n;i++)
d[1][i]=1,d[i][0]=1;
cout<<dfs(k,n)<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
#include <cstring>
int d[105][105],n;
int dfs(int k,int m)
{
int i;
if(d[k][m]!=0) return d[k][m];
for(i=0;i<=n;i++)
if(m-i>=0) d[k][m]=(d[k][m]+dfs(k-1,m-i))%1000000;
return d[k][m];
}
int main(int argc, char *argv[])
{
int i,k;
while(cin>>n>>k&&(n||k))
{
memset(d,0,sizeof(d));
for(i=0;i<=n;i++)
d[1][i]=1,d[i][0]=1;
cout<<dfs(k,n)<<endl;
}
return 0;
}