#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll N, R;
cin >> N >> R;
ll ans = 0;
// Enumerate divisor pairs (x, y) of R with x < y
for (ll x = 1; x * x <= R; ++x) {
if (R % x == 0) {
ll y = R / x;
if (x < y && __gcd(x, y) == 1) {
// For each valid (x, y), g can be 1..floor(N / y)
ans += N / y;
}
}
}
cout << ans;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnVzaW5nIGxsID0gbG9uZyBsb25nOwoKaW50IG1haW4oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOwoKICAgIGxsIE4sIFI7CiAgICBjaW4gPj4gTiA+PiBSOwogICAgbGwgYW5zID0gMDsKCiAgICAvLyBFbnVtZXJhdGUgZGl2aXNvciBwYWlycyAoeCwgeSkgb2YgUiB3aXRoIHggPCB5CiAgICBmb3IgKGxsIHggPSAxOyB4ICogeCA8PSBSOyArK3gpIHsKICAgICAgICBpZiAoUiAlIHggPT0gMCkgewogICAgICAgICAgICBsbCB5ID0gUiAvIHg7CiAgICAgICAgICAgIGlmICh4IDwgeSAmJiBfX2djZCh4LCB5KSA9PSAxKSB7CiAgICAgICAgICAgICAgICAvLyBGb3IgZWFjaCB2YWxpZCAoeCwgeSksIGcgY2FuIGJlIDEuLmZsb29yKE4gLyB5KQogICAgICAgICAgICAgICAgYW5zICs9IE4gLyB5OwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQoKICAgIGNvdXQgPDwgYW5zOwogICAgcmV0dXJuIDA7Cn0K