#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N,K;

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> N >> K;
    
    int cnt = 0;
    FOR(i, 2, min((int)sqrt(K), 2*N)+1) {
        if (K % i != 0) continue;
        int j = K / i;
        if (j > 2 * N) continue;
        int axc = (i > N) ? 2 * N - i + 1 : i - 1;
        int bxd = (j > N) ? 2 * N - j + 1: j - 1;
        int add = axc * bxd;
        if (j != i) add *= 2;
        cnt += add;
    }
    
    cout << cnt << endl;
    
    return 0;
}