#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vll vector<ll>
#define mp make_pair
#define pb push_back
#define pll pair<ll,ll>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define F(i,a,n) for(ll i=a;i<n;i++)
#define fil(ar, val) memset(ar, val, sizeof(ar))
using namespace std;

const int mod = 1000000007;



int main() {

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll t;
    t = 1;
    // cin >> t;
    while (t--)
    {
        ll md=10000;
        ll n,k;
        cin>>n>>k;
        ll dp[k+1][n+1];
        memset(dp,0,sizeof(dp));
        for(ll i=1;i<=n;i++)
        {
            dp[1][i]=1;
        }
        for(ll i=2;i<=k;i++)
        {
            for(ll j=1;j<=n;j++)
            {
                for(ll p=1;p<=sqrt(j);p++)
                {
                    if(j%p==0)
                    {
                        if(j/p!=p)
                        {
                            dp[i][j]=(dp[i][j]+dp[i-1][p])%md;
                            dp[i][j]=(dp[i][j]+dp[i-1][j/p])%md;
                        }
                        else
                        {
                            dp[i][j]=(dp[i][j]+dp[i-1][p])%mod;
                        }
                    }
                }
            }
        }
        ll ans=0;
        for(ll i=1;i<=n;i++)
        {
            ans=(ans+dp[k][i])%md;
        }
        cout<<ans<<"\n";
        
       
    }


    return 0;



}