#include <iostream>
#include <fstream>

using namespace std;

ifstream in("pascal.in");
ofstream out("pascal.out");

const int MAXN = 5e6;

int n, d;
// divisor[i][j] = the numberof factors j in i!
int fact[MAXN + 5][6];

int get_fact(int n, int d) {
	int cnt = 0;
	while (n % d == 0) {
		n /= d;
		cnt++;
	}
	return cnt;
}

int main() {

	in >> n >> d;

	for (int i = 1; i <= n; i++) {
		fact[i][2] = fact[i - 1][2] + get_fact(i, 2);
		fact[i][3] = fact[i - 1][3] + get_fact(i, 3);
		fact[i][5] = fact[i - 1][5] + get_fact(i, 5);
	}

	int ans = 0;
	for (int i = 0; i <= n; i++) {
		if (d == 2 || d == 3 || d == 5) {
			int p = fact[n][d] - fact[n - i][d] - fact[i][d];
			if (p) { ans++; }
		}
		if (d == 4) {
			int p = fact[n][2] - fact[n - i][2] - fact[i][2];
			p /= 2;
			if (p) { ans++; }
		}
		if (d == 6) {
			int p2 = fact[n][2] - fact[n - i][2] - fact[i][2];
			int p3 = fact[n][3] - fact[n - i][3] - fact[i][3];
			int p = min(p2, p3);
			if (p) { ans++; }
		}
	}

	out << ans;

	return 0;
}