#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    ll K, N;
    cin >> K >> N;
    ll max_c = 55440;
    if (K == N && max_c % N != 0) {
        cout << 1 << endl;
        return 0;
    }
    vector<vector<ll>> dp(K + 1, vector<ll>(max_c + 1, 0));
    dp[0][0] = 1;
    for (ll i = 0; i < K; i++) {
        for (ll j = 0; j <= max_c; j++) {
            for (ll k = 1; k <= N; k++) {
                if (max_c % k != 0) {
                    continue;
                }
                ll div = 55440 / k;
                if (j + div <= max_c) {
                    dp[i + 1][j + div] += dp[i][j];
                }
            }
        }
    }
    cout << dp[K][max_c] << endl;
}