#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[200105], nxt[200105];
long long ans;
void fmain(int ID) {
  scanf("%d%d", &n, &k);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  for (int i = n; i; i--) {
    if (a[i + 1] != 1)
      nxt[i] = i + 1;
    else
      nxt[i] = nxt[i + 1];
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    long long x = a[i], y = a[i];
    if (x == y * k) ans++;
    for (int j = nxt[i], l = i;; j = nxt[j]) {
      if (x % k == 0 && x / k > y) {
        if (x / k - y <= j - 1 - l) ans++;
      }
      y += j - 1 - l;
      if (j == n + 1) break;
      if ((long double)x * a[j] > 4e18) break;
      x *= a[j];
      y += a[j];
      if (x % k == 0 && x / k == y) ans++;
      l = j;
    }
  }
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
