#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <cassert>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

vector<ll> D;
map<ll, int> M;
vector<vector<vector<int>>> dp;

// D[n]をD[m]以上のk個の約数に分解する方法
int dec(int n, int m, int k){
    if(k >= 32) return 0;
//    cout << D[n] << ", " << D[m] << ", " << k << endl;
    if(dp[n][m][k] >= 0) return dp[n][m][k];
    if(k == 0){
        if(D[n] == 1) return dp[n][m][k] = 1;
        else dp[n][m][k] = 0;
    }
    if(k == 1){
        if(n >= m) return dp[n][m][k] = 1;
        else dp[n][m][k] = 0;
    }
    int ret = 0;
    for(int i = m; D[i] * D[i] <= D[n]; i++){
        if(D[n] % D[i] == 0){
            ll a = D[n];
            int cnt = 1;
            while(a % D[i] == 0 && k >= cnt){
                a /= D[i];
                ret += dec(M[a], i + 1, k - cnt);
                cnt++;
            }
        }
    }
    return dp[n][m][k] = ret;
}


vector<ll> divisors(ll n){
    vector<ll> ret;
    for(ll d = 1; d * d <= n; d++){
        if(n % d == 0){
            ret.pb(d);
            if(d * d != n) ret.pb(n / d);
        }
    }
    sort(all(ret));
    rep(i, ret.size()){
        M[ret[i]] = i;
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    
    int N;
    ll X;
    cin >> N >> X;
    assert(2 <= N && N <= 100);
    assert(1 <= X && X <= 1e9);
    D = divisors(X + 1);
    dp.assign(D.size(), vector<vector<int>>(D.size(), vector<int>(32, -1)));
    
    
    output(dec((int)D.size() - 1, 1, N));
    
    return 0;
}