#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  long long n, k; cin >> n >> k;
  long long ans = 0;
  for (long long i = 2; i * i <= k; ++i) if (k % i == 0) {
    long long j = k / i;
    if (j <= 1) continue;
    long long a = i - 1;
    if (a > n) a -= (i - 1 - n) * 2;
    long long b = j - 1;
    if (b > n) b -= (j - 1 - n) * 2;
    if (a < 0 || b < 0) continue;
    // cout << i << ' ' << a << ' ' << b << '\n';
    long long tmp = a * b;
    if (i * i < k) tmp *= 2;
    ans += tmp;
  }
  cout << ans << '\n';
  return 0;
}