#pragma GCC optimize(2)

#pragma GCC optimize(3)

#pragma GCC optimize(4)

#include<bits/stdc++.h>

using namespace std;

#define y1 y11Z

#define se second

#define pi acos(-1.0)

#define LL long long

//#define mp make_pair

#define pb push_back

#define ls rt<<1, l, m

#define rs rt<<1|1, m+1, r

#define ULL unsigned LL

#define pll pair<LL, LL>

#define pli pair<LL, int>

#define pii pair<int, int>

#define piii pair<int, pii>

#define puu pair<ULL, ULL>

#define MOD(a, b) (a >= b ? a%b+b : a%b)

#define pdd pair<long double, long double>

#define mem(a, b) memset(a, b, sizeof(a))

#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

#define fopen freopen("in.txt", "r", stdin);freopen("out.txt", "w", stout);

//head

const int N = 1e5 + ;

const int MOD = 1e9 + ;

int n, k, l[N], r[N], cnt = ;

int dp[][N];

int main() {

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

    for (int x = , y; x <= n; x = y+) {

        y = n/(n/x);

        l[++cnt] = x;

        r[cnt] = y;

    }

    for (int i = ; i <= cnt; ++i) dp[][i] = (dp[][i-] + r[i]-l[i]+)%MOD;

    for (int i = ; i <= k; ++i) {

        for (int j = ; j <= cnt; ++j) {

            dp[i][j] = (dp[i][j-] + (dp[i-][cnt-j+])*1LL*(r[j]-l[j]+)%MOD)%MOD;

        }

    }

    printf("%d\n", dp[k][cnt]);

    return ;

}