//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

using LL = long long;

//------------------------------------------
//------------------------------------------

vector<LL> DIVOSORS(LL x) {
    vector<LL> ret;
    for (LL i = 1; i * i <= x; i++) {
        if (x % i == 0) {
            ret.push_back(i);
            if (x / i != i) {
                ret.push_back(x / i);
            }
        }
    }
    sort(ret.begin(), ret.end());
    return ret;
}

int main() {

    LL N, K;
    cin >> N >> K;

    auto divisors = DIVOSORS(K);
    SHOW_VECTOR(divisors);

    LL ans = 0;
    for (auto x: divisors) {
        LL y = K / x;

        LL d1 = max(0LL, (x - 1) - 2 * max(0LL, (x - 1 - N)));
        LL d2 = max(0LL, (y - 1) - 2 * max(0LL, (y - 1 - N)));

        ans += d1 * d2;
    }

    cout << ans << endl;

}