#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))
typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;
#define int long long
const int N = 1e5+2;
const int INF = 1<<30;
const int mod = 1e9+7;
int n,k,a[N],sum[N],p[N],cnt=1;
map<int,int> mp;
void solve(){
scanf("%lld%lld",&n,&k);
p[0]=1;p[1]=k;cnt=2;
if(abs(k)!=1) for(int i=2;abs(p[cnt-1])<=1e14;i++) p[i]=p[i-1]*k,++cnt;
for(int i=1;i<=n;i++) scanf("%lld",&a[i]),sum[i]+=sum[i-1]+a[i];
int res=0;
mp[0]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<cnt;j++){
if(p[j]==p[j-1]) continue;
int now=sum[i]-p[j];
if(mp.count(now)) res+=mp[now];
}
mp[sum[i]]++;
}
cout<<res<<endl;
return;
}
int32_t main()
{
int t = 1;
while(t--){
solve();
}
return 0;
}