#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 2e5 + 5;
int n, k;
int a[maxn];
int nxt[maxn];
void chemthan() {
  cin >> n >> k;
  for (int i = (0); i < (n); ++i) cin >> a[i];
  for (int i = (n)-1; i >= (0); --i) {
    if (a[i] > 1) {
      nxt[i] = -1;
    } else {
      nxt[i] = i;
      if (i < n - 1 && a[i + 1] == 1) {
        nxt[i] = nxt[i + 1];
      }
    }
  }
  long long res = 0;
  for (int i = (0); i < (n); ++i) {
    int st = i;
    long long prd = 1, sum = 0;
    while (st < n) {
      if (a[st] == 1) {
        int nst = nxt[st];
        if (prd % k == 0) {
          long long need = prd / k - sum;
          if (1 <= need && need <= nst - st + 1) {
            res++;
          }
        }
        sum += nst - st + 1;
        st = nst + 1;
        continue;
      }
      if (prd > 4 * LINF / a[st]) {
        break;
      }
      prd *= a[st];
      sum += a[st];
      if (prd % k == 0 && prd / k == sum) {
        res++;
      }
      st++;
    }
  }
  cout << res << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
