#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll mx=100100;
    vector<map<ll,ll>> A(mx,map<ll,ll>());
    for(int i=1;i<mx;i++){
        A[i][1]=1;
        for(auto t=A[i].begin();t!=A[i].end();++t){
            for(ll h=2;i*h<mx;h++){
                A[i*h][t->first+1]+=t->second;
            }
        }
    }
    ll n,k;
    cin>>n>>k;
    ll ans=0;
    for(int i=1;i<=n;i++){
        ans+=A[i][k];
    }
    cout<<ans<<endl;
    
    
    
    return 0;
}

