
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
typedef long long int ll;

ll ans=0;
int n,k;

int main(){
  cin>>n>>k;
  int dp[100050][20];
  rep(i,n+1){
    rep(j,k+1){
      dp[i][j]=0;
    }
  }
  rep(i,n+1){
    dp[i][1]=1;
  }
  repi(i,2,k+1){
    repi(j,i-1,n+1){
      for(int k=2;k<=n;k++){
	if(j*k>n) break;

	else dp[j*k][i]+=dp[j][i-1];
      }
    }
  }
 
  ll ans=0;
  repi(i,1,n+1){
    ans+=dp[i][k];
  }
  cout<<ans<<endl;
  return 0;
}








