#include <stdio.h>
int m, a[24]; long long n;
int rec(int pos, long long x) {
	if(pos == 0) return 1;
	int ret = 0;
	if(x % a[pos - 1]) ret += rec(pos - 1, x);
	if(x * a[pos - 1] <= n) ret += rec(pos - 1, x * a[pos - 1]);
	return ret;
}
int main() {
	scanf("%lld%d", &n, &m);
	for(int i = 0; i < m; i++) scanf("%d", &a[i]);
	printf("%d\n", rec(m, 1));
}