#include <iostream>
#include <unordered_map>

int main() {
    int N, K;
    std::cin >> N >> K;
    std::unordered_map<int, int> dp;
    dp[1] = 1;
    int ans = 0;
    for (int i = 1; i <= N; i++) {
        std::unordered_map<int, int> new_dp = dp;
        for (const auto& p : dp) {
            int k = p.first;
            int v = p.second;
            if (i * k * (i + 1) < K) {
                new_dp[i * k] += v;
            } else if (i * k <= K) {
                ans += v;
            }
        }
        dp = new_dp;
    }
    int s = 0;
    for (auto p : dp) {
        s += p.second;
    }
    std::cout << ans + s - 1 << std::endl;
    return 0;
}