#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;
// constexpr int mod = 998244353;

vector<ll> divisor(ll x){
    vector<ll> res;
    for(ll i = 1; i * i <= x; ++i){
        if(x % i == 0){
            res.emplace_back(i);
            if(i * i != x)  res.emplace_back(x / i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

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

    ll n, k;
    cin >> n >> k;
    vector<ll> div = divisor(k);
    ll ans = 0;
    int sz = div.size();
    for(int i = 0; i < sz; ++i){
        ll foo = div[i], bar = k / div[i];
        if(foo == 1 || bar == 1)    continue;
        if(foo > n * 2 || bar > n * 2)  continue;
        ll lb = max(1ll, foo - n);
        ll ub = min(n, foo - 1);
        ll cnt = ub - lb + 1;
        lb = max(1ll, bar - n);
        ub = min(n, bar - 1);
        cnt *= ub - lb + 1;
        ans += cnt;
    }
    cout << ans << endl;
}