414B.cpp

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <stack>
#include <cassert>
#include <fstream>
#include <cstring>
#include <numeric>
#include <ctype.h>
#include <stdio.h>
#define MOD 1000000007  
#define exit return 0
#define inf 10000000000
#define exit return 0
#define PS system("pause")
#define S 100007
#define mx(a,b) a>b?a:b
#define R0(i,n) for (i = 0; i < n; i++)
#define R1(i,n) for (i = 1; i <= n; i++)
#define MS(a,x) memset(x, a, sizeof(x));
#define left (v<<1)
#define right (left|1)
#define mid ((tl+tr)>>1)
#define SZ(x) ((int)x.size())
#define MX(a,b)a>b?a:b
const double eps = 1e-10;


using namespace std;
using ll = long long;
using ul = unsigned long long;
using PII = pair<int, int>;

const int NN = 2002;
vector<int>gr[NN];
int n, k;
// m, s, x, a, b, c, d, e, q;
int answww;
//int in[NN], aa[3], bb[3];
int dp[NN][NN];
int go(int last, int sig){
	if (sig > k)return 0;
	if (sig == k){
		return 1;
	}
	int res = dp[last][sig];
	if (dp[last][sig] != -1)return dp[last][sig];
	res = 0;
	int dd = last;
	for (int xx = dd; xx <= n; xx += dd){
		res += go(xx, sig + 1);
		res %= MOD;
	}
	res %= MOD;
	dp[last][sig] = res;
	return res;
}


int main(){
	scanf("%d %d", &n, &k);
	int ff = 1;
	//cout << go(1, 1);
	memset(dp, -1, sizeof(dp));
	for (int i = 1; i <= n; i++){
		answww += go(i, 1);
		answww %= MOD;
	}
	answww %= MOD;
	printf("%d\n", answww);
	//PS;
	exit;
}