#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(v) v.begin(),v.end()
#define dbg(x) cerr << #x << ": " << (x) << endl;
template<class F, class S>
ostream& operator<<(ostream& os, pair<F,S>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<class Iter>
void print(Iter beg, Iter end) {
    for (Iter itr = beg; itr != end; ++itr) {
        cerr << *itr << ' ';
    }
    cerr << '\n';
}
inline bool naraba(bool a, bool b) { return (!a || b); }

int K,N;

int main() {
    cin >> K >> N;

    int L = 1;
    for (int i = 1; i <= N; ++i) {
        if (i==13 || i==17 || i==19 || i==23) continue;
        L = lcm(L,i);
    }
    dbg(L)
    vector<ll> v;
    for (int i = 1; i <= N; ++i) {
        if (i==13 || i==17 || i==19 || i==23) continue;
        v.push_back(L / i);
    }

    vector dp(K+1, vector<ll>(L+1));
    dp[0][0] = 1;
    for (int i = 1; i <= K; ++i) {
        for (int j = 1; j <= L; ++j) {
            for (ll use : v) {
                if (j-use >= 0) {
                    dp[i][j] += dp[i-1][j-use];
                }
            }
        }
    }
    ll ans = dp[K][L];
    for (int i : {13,17,19,23}) {
        if (i <= N) {
            ans += (K==i);
        } else {
            break;
        }
    }
    cout << ans << '\n';
}