#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  while ((a = a % b) != 0) {
    swap(a, b);
  }
  return b;
}
long long mpow(long long x, long long y, long long m) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % m;
    y = y >> 1;
    x = x * x % m;
  }
  return res;
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  long long res = 1;
  for (long long i = (1); i < (r + 1); i++) res = res * (n - r + i) / i;
  return res;
}
long long *sieve(long long n) {
  long long *lpf = new long long[n + 1];
  for (long long i = 1; i <= n; i++) lpf[i] = i;
  long long rt = (long long)floor(sqrt(n)) + 1;
  for (long long i = (2); i < (rt); i++) {
    if (lpf[i] != i) continue;
    for (long long j = i * i; j <= n; j += i) {
      if (lpf[j] == j) lpf[j] = i;
    }
  }
  return lpf;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a[n], next[n], sum = 0;
  for (long long i = (0); i < (n); i++) cin >> a[i];
  for (long long i = (n - 1); i > (-1); i--) {
    if (a[i] == 1) {
      if (i + 1 != n && a[i + 1] == 1)
        next[i] = next[i + 1];
      else
        next[i] = i + 1;
    } else
      next[i] = i;
    sum += a[i];
  }
  long long ans = 0;
  for (long long i = (0); i < (n); i++) {
    long long p = 1, s = 0, j = i;
    while (j != n && p <= sum * k / a[j]) {
      if (a[j] == 1) {
        if (p % k == 0) {
          long long req = p / k;
          if (req > s && req <= s + next[j] - j) ans++;
        }
        s += next[j] - j;
        j = next[j];
        continue;
      }
      p *= a[j];
      s += a[j];
      if (p == s * k) ans++;
      j++;
    }
  }
  cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = (1); i < (t + 1); i++) {
    solve();
    cout << "\n";
  }
}
