#include<cstdio>

const int mod=;

int n,k,mp[];

int qp(int a,int k)

{

    int res=;

    while(k)

    {

        if(k&)res=1ll*res*a%mod;

        a=1ll*a*a%mod;k/=;

    }

    return res;

}

int C(int a,int b)

{

    int ans=;

    for(int i=a,x;i>=a-b+;i--)

    {

        x=i;

        for(int j=;j*j<=x;j++)

        while(x%j==)x/=j,mp[j]++;

        mp[x]++;

    }

    for(int i=,x;i<=b;i++)

    {

        x=i;

        for(int j=;j*j<=x;j++)

        while(x%j==)x/=j,mp[j]--;

        mp[x]--;

    }

    for(int i=;i<=;i++)ans=1ll*ans*qp(i,mp[i])%mod;

    return ans;

}

int main()

{

    scanf("%d%d",&n,&k);

    printf("%d\n",C(n+k-,n-));

}