#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<deque>
#include<string>
#include<unordered_map>
#include<bitset>
#include<random>
#include<chrono>
#include<cstdarg>
//Eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
using namespace std;
const int MAXN = 61;
typedef long long ul;
map<ul, ul> dp;
ul X;
vector<ul> psa;
ul f(ul i) {
if (i == 0) return 1;
if (dp.find(i) == dp.end()) {
ul mx = log2(i);
dp[i] = f(i - (1 << mx)) + f(min(i, psa[mx] / X) - (1 << mx));
}
return dp[i];
}
ul count_tastiness(ul x, vector<ul> a) {
int N = a.size(); X = x;
dp = map<ul, ul>();
psa = vector<ul>(MAXN);
psa[0] = a[0];
for (int i = 1; i < N; i++) psa[i] = psa[i - 1] * a[i] << i;
return f(1LL << 60);
}
