#include <iostream>
#include <cstdio>
#define MOD 1000000007
using namespace std;
long long  n,k,a[10001],ans[10001][10001],br=0;
int main()
{
    freopen("scourge.in","r",stdin);
    freopen("scourge.out","w",stdout);
    cin>>n>>k;
    for(int i=2;i<k;i++)
    {
        bool primal=1;
        for(int j=2;j*j<=i;j++)
            if(i%j==0)
            {
                primal=0;
                break;
            }
        if(primal)
        {
            a[br++]=i;
        }
    }
    for(int i=0;i<br;i++)
    {
        ans[a[i]][i]=1;
        ///cout<<a[i]<<endl;
    }
    for(int i=2;i<=n;i++)
        for(int j=0;j<br;j++)
            for(int f=j;f<br;f++)
                ans[i+a[f]][f]=(ans[i+a[f]][f]+ans[i][j])%MOD;
    long long  answer=0;
    for(int i=0;i<br;i++)
        answer+=ans[n][i];
    answer%=MOD;
    cout<<answer<<endl;
}