#include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma region using namespace std; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define rep(i,n) FOR(i,0LL,n) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define rrep(i,n) RFOR(i,0LL,n) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x) #define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end()) #define pb push_back typedef long long int ll; typedef vector vll; typedef vector vvll; typedef pair pll; typedef vector vpll; typedef vector vs; typedef map MAP; const ll inf = 1LL << 62; const ll mod = 1000000007LL; //const ll mod = 998244353LL; ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf; string s; bool ok; ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 }; #define endl '\n' #pragma endregion #define MAX 222222 bool visited[5 * MAX]; struct UnionFind { vll rank, par, data; UnionFind(ll x = MAX) { rank.resize(x + 1, 0); par.resize(x + 1, 0); data.resize(x + 1, 1); rep(i, x + 1) par[i] = i; } ll root(ll x) { if (x != par[x]) par[x] = root(par[x]); return par[x]; } ll size(ll x) { return data[root(x)]; } void unite(ll a, ll b) { ll x = root(a); ll y = root(b); if (x == y) return; if (rank[x] > rank[y]) { par[y] = x; data[x] += data[y]; } else { par[x] = y; data[y] += data[x]; if (rank[x] == rank[y]) rank[y]++; } } bool same(ll a, ll b) { return root(a) == root(b); } }; int main(void) { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; UnionFind uf(MAX * 5); FOR(i, 2, n + 1) { if (visited[i]) continue; ll cur = i; while (cur <= n) { visited[cur] = true; cur += i; uf.unite(i, cur); } } FOR(i, 1, n + 1) if (uf.same(i, m)) ans++; cout << ans << endl; return 0; }