#include <bits/stdc++.h>
using namespace std;
const long long int maxn = 2e5 + 6;
const long long int inf = 2e18 + 1;
long long int a[maxn];
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int next[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  next[n - 1] = n;
  for (long long int i = n - 2; i >= 0; i--) {
    if (a[i + 1] != 1) {
      next[i] = i + 1;
    } else {
      next[i] = next[i + 1];
    }
  }
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    if (k == 1) {
      ans++;
    }
    long long int r = i;
    long long int mul = a[i];
    long long int sum = a[i];
    while (next[r] != n && a[next[r]] <= inf / mul) {
      mul = mul * a[next[r]];
      sum = sum + next[r] - r - 1 + a[next[r]];
      r = next[r];
      long long int check = -1;
      if (mul % k == 0) {
        check = mul / k;
      }
      long long int store = next[r] - r - 1;
      if (check >= sum && check <= sum + store) {
        ans = ans + 1;
      }
    }
  }
  cout << ans;
  return 0;
}
