#include <bits/stdc++.h>   using namespace std;   long long n, k;   long long a[100010];   signed main() {     scanf( %lld%lld , &n, &k);     long long cnt = 1;     long long l = 1;     long long ans = 0;     for (long long i = 1; i <= n; i++) {       scanf( %lld , &a[i]);       cnt = cnt * a[i] % k;       if (!cnt) {         cnt = 1;         long long j;         for (j = i; j >= 1 && cnt * a[j] % k; j--) cnt = cnt * a[j] % k;         ans += (n - i + 1) * (j - l + 1);         l = j + 1;       }     }     cout << ans;     return 0;   }   