#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<math.h>

using namespace std;

#define INF 1000000007
#define LINF 1000000000000000007

typedef long long i64;
typedef pair<i64,i64> P;


i64 n, k;

int main(){
	cin >> n >> k;
	//(a+c)(b+d)
	
	i64 ans = 0;
	for(i64 i = 2; i*i <= k; i++){
		if(k % i) continue;
		if(k/i > n*2) continue;
		ans += (i-1) * min(k/i-1, n*2 - k/i +1) * 2;
	}
	
	cout << ans << endl;
	
	return 0;
}