#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;



signed main(){

    int N, K; cin >> N >> K;
    
    const int M = 100000;
    mat dp(N + 1, vec(M + 1, 0)), dq(N + 1, vec(M + 1, 0));
    dp[0][1] = dq[0][1] = 1;

    REP(i, N){
        FOR(j, 1, M + 1){
            dp[i + 1][j] += dp[i][j];
            if(j * (i + 1) <= M) dp[i + 1][j * (i + 1)] += dp[i][j];
        } 
    }
    REP(i, N){
        FOR(j, 1, M + 1){
            dq[i + 1][j] += dq[i][j];
            if(j * (N - i) <= M) dq[i + 1][j * (N - i)] += dq[i][j];
        } 
    }
    //mdebug(dp); mdebug(dq);

    REP(i, N + 1){
        FOR(j, 1, M + 1){
            dq[i][j] += dq[i][j - 1];
        }
    }

    int ans = 0;
    FOR(x, 1, N + 1){
        FOR(l, 1, M + 1) if(l * x <= K){
            int rmax = min(K / (l * x), l * x);
            int rmin = l / x + 1;
            if(rmin <= rmax) ans += dp[x - 1][l] * (dq[N - x][rmax] - dq[N - x][rmin - 1]);
        }
    }
    ans++;
    Out(ans);

    return 0;
}