C++ :

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
#include <complex>
#include <ctime>

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define repeat(i, a, b) for(int i=(a);i<=(b);i++)
#define all(v) (v).begin(), (v).end()
#define Unique(store) store.resize(unique(store.begin(),store.end())-store.begin())
#define X first
#define Y second



using namespace std;
const int N=1000+10;
int dp[N][N];
int main () {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,k;
    while (cin>>k>>n){
        int u=1;
        memset(dp,0,sizeof dp);
        for (int j=1;j<=n;j++) dp[1][j]=1;
        for (int i=1;i<k;i++){
            for (int j=1;j<=n;j++){
                for (int mul=1;mul*j<=n;mul++){
                    dp[i+1][mul*j]+=dp[i][j];
                    dp[i+1][mul*j]%=(int)1e9+7;
                }
            }
        }
        int sum=0;
        for (int j=1;j<=n;j++) {
            sum+=dp[k][j];
            sum%=(int)1e9+7;
        }
        cout<<sum<<endl;
    }
    return 0;
}