#include <bits/stdc++.h>

using ll = std::int64_t;

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int K, N;
    std::cin >> K >> N;

    const int EXCEPTIONS = (1 << 13) | (1 << 17) | (1 << 19) | (1 << 23);
    const int MAX_DEN = 55440;

    std::vector dp(K + 1, std::vector<ll>(MAX_DEN + 1, 0));
    dp[0][0] = 1;
    for(int i=0;i<K;i++){
        for(int j=0;j<=MAX_DEN;j++){
            for(int k=1;k<=N;k++){
                if(EXCEPTIONS >> k & 1){continue;}
                int num = MAX_DEN / k;
                if(j + num <= MAX_DEN){
                    dp[i + 1][j + num] += dp[i][j];
                }
            }
        }
    }

    ll res = dp[K][MAX_DEN];
    if(EXCEPTIONS >> K & 1){
        res += 1;
    }
    std::cout << res << std::endl;
}