#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC(T, v) static_cast<T>(v)
#define SI(v) SC(int, v.size())
#define SL(v) SC( LL, v.size())
#define RF(e, v) for(auto & e: v)
#define ei else if
#define UR assert(false)

// ---- ----

class UnionFind {
private:
	int n, s;
	vector<int> p_id;
	vector<vector<int>> v;
public:
	UnionFind(int n = 0) { init(n); }
	void init(int arg_n) {
		n = s = arg_n;
		p_id.clear();
		v.clear();
		inc(i, n) { p_id.PB(i); v.EB(1, i); }
	}
	int id(int i) { return p_id.at(i); }
	bool same(int x, int y) { return (id(x) == id(y)); }
	bool unite(int x, int y) {
		x = id(x);
		y = id(y);
		if(x == y) { return false; }
		if(v[x].size() < v[y].size()) { swap(x, y); }
		for(auto & e: v[y]) { v[x].PB(e); p_id[e] = x; }
		v[y].clear();
		s--;
		return true;
	}
	const vector<int> & operator[](int i) { return v[id(i)]; }
	int size() { return s; }
	int get_n() const { return n; }
	const vector<vector<int>> & get_v() const { return v; }
};
ostream & operator<<(ostream & os, const UnionFind & uf) {
	inc(i, uf.get_n()) { os << i << ": "; for(auto & e: uf.get_v()[i]) { os << e << " "; } os << "\n"; }
	return os;
}

// ---- ----

int n, p;

int main() {
	cin >> n >> p;
	
	UnionFind uf(n + 1);
	incII(i, 2, n) {
		for(int j = i; j <= n; j += i) { uf.unite(i, j); }
	}
	
	cout << SI(uf[p]) << endl;
	
	return 0;
}