// {{{ Templates
#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

// }}}

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

    int N;
    cin >> N;

    ll X;
    cin >> X;
    X++;

    if (N > (ll)log2(X)) {
        cout << 0 << endl;
        return 0;
    }

    vector<ll> divs;
    for (ll i = 1; i * i <= X; i++) {
        if (X % i == 0) {
            if (i * i != X) {
                if (i != 1) {
                    divs.push_back(i);
                }
                divs.push_back(X / i);
            } else {
                divs.push_back(i);
            }
        }
    }
    sort(divs.begin(), divs.end());
    unordered_map<ll, int> zip;
    divs.erase(unique(divs.begin(), divs.end()), divs.end());
    for (int i = 0; i < divs.size(); i++) {
        zip[divs[i]] = i;
    }
    //    show(divs);
    const int size = divs.size();
    //    show(size);
    vector<vector<vector<ll>>> dp(N, vector<vector<ll>>(size, vector<ll>(size, 0)));   // n個で積がXでn個目がY である集合の個数
    vector<vector<vector<ll>>> sum(N, vector<vector<ll>>(size, vector<ll>(size, 0)));  // n個で積がXでn個目がY以下である集合の個数
    for (int x = 0; x < size; x++) {
        for (int y = 0; y < size; y++) {
            dp[0][x][y] = (x == y) ? 1 : 0;
            if (y == 0) {
                sum[0][x][0] = (x == 0) ? 1 : 0;
            } else {
                sum[0][x][y] = sum[0][x][y - 1] + dp[0][x][y];
            }
        }
    }
    for (int i = 1; i < N; i++) {
        for (int x = 0; x < size; x++) {
            for (int y = 0; y < size; y++) {
                if (y < x and divs[x] % divs[y] == 0) {
                    dp[i][x][y] = sum[i - 1][zip[divs[x] / divs[y]]][y];
                }
                if (y == 0) {
                    sum[i][x][y] = dp[i][x][y];
                } else {
                    sum[i][x][y] = sum[i][x][y - 1] + dp[i][x][y];
                }
            }
        }
    }
    cout << sum[N - 1][size - 1][size - 1] << endl;

    return 0;
}