#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

const int maxN = 1e4 + 5, mod = 1e9 + 7;

long long n, k, dp[maxN], primes[maxN], ind;

bool isPrime(int p)
{
    if(p < 2) return false;
    if(p == 2) return true;
    if(p % 2 == 0) return false;

    int sqr = sqrt(p);
    for(int i = 3; i <= sqr; i += 2)
    {
        if(p % i == 0) return false;
    }

    return true;
}
void generatePrimes(int p)
{
    for(int i = 2; i < p; i++)
    {
        if(isPrime(i)) primes[ind++] = i;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    freopen("scourge.in", "r", stdin);
    freopen("scourge.out", "w", stdout);

    cin>>n>>k;

    generatePrimes(k);

    dp[0] = 1;
    for(int i = 0; i < ind; i++)
    {
        for(int j = primes[i]; j <= n; j++)
        {
            //cout<<dp[j]<<" "<<j<<" "<<dp[j - primes[i]]<<" "<<j - primes[i]<<endl;
            dp[j] = (dp[j] + dp[j - primes[i]]) % mod;
        }
    }

    cout<<dp[n]<<endl;
    return 0;
}