#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <int,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int> 
#define vec(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
 
const int max_n = 103002;
 
using namespace std;
ll n,k;

unordered_map <ll,ll> memo[300];

// ll slv(ll i,ll k) {
// 	if(i>k) return 0;
// 	if(i>n) return 1;
// 	// if(memo[i].find(k)!=memo[i].end()) return memo[i][k];
// 	// cout << i << " " << k << "\n";
// 	if(i==k) return memo[i][k] = 1;
// 	return memo[i][k] = (i+1>=k/i?1:slv(i+1,k/i)) + slv(i+1,k);
// }

int main(){
fcin;

	cin>>n>>k;
	
	memo[1][k]=2;

	ll ans=0;
	
	crep(a,2,n+1) {
		memo[a]=memo[a-1];
		for(auto p : memo[a-1]) {
			// memo[a+1][p.fi] += p.se;
			if(p.fi/a>0) memo[a][p.fi/a] += p.se;
		}
		// cout << a << "\n";
		// for(auto p : memo[a]) {
		// 	cout << p.fi << " " << p.se << "\n";
		// }
		// cout<<"\n\n";
	}
	
	for(auto p : memo[n]) {
	// 	// cout << p.fi << " " << p.se << "\n";
		ans+=p.se;
	}
	// ll ans = slv(2,k);
 	cout << ans-1 << "\n";
/*
*/
 
    return 0;   
}