#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define replr(i,l,r) for (ll i=(ll)(l);i<(ll)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((ll)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll k,n;
    cin >> k >> n;
    ll l=1;
    set<ll> st={13,17,19,23};
    replr(i,2,n+1){
        if(st.contains(i)) continue;
        l=lcm(l,i);
    }
    vector<vector<ll>> dp(k+1,vector<ll>(l+1,0));
    dp[0][0]=1;
    rep(i,k){
        rep(j,l+1){
            replr(x,1,n+1){
                if(st.contains(x)) continue;
                if(j+l/x<=l) dp[i+1][j+l/x]+=dp[i][j];
            }
        }
    }
    cout << dp[k][l]+st.contains(k) << '\n';
}