#include<iostream>
#include<fstream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;

#define MOD 1000000007
#define MAXN 10000
unsigned long long table[MAXN+1];
unsigned long long count( unsigned long long S[], unsigned long long m, unsigned long long n )
{
    table[0] = 1;

    for(unsigned long long i=0; i<m; i++)
        for(unsigned long long j=S[i]; j<=n; j++)
            table[j] = (table[j]+table[j-S[i]])%MOD;

    return table[n];
}

unsigned long long n,m;
unsigned long long primes[5000];
unsigned long long count1;

bool prime (unsigned long long x)
{
    if(x<2) return 0;
    if(x==2||x==3) return 1;
    for(unsigned long long i=2;i*i<=x;i++) if(x%i==0) return 0;
    return 1;
}
int main()
{
    freopen("scourge.in","r",stdin);
    freopen("scourge.out","w",stdout);

    cin>>n>>m;
    for(unsigned long long i=0;i<=m;i++) if(prime(i)) primes[count1++]=i;
    cout<<count(primes, count1, n)<<endl;
    return 0;
}