#include<bits/stdc++.h>
#define ll long long
#define N 100001
#define mod 998244353
using namespace std;
ll n,k,p,a[N],ans,sum,fac[N]={1},inv[N];
ll read(){
	ll x=0,f=1;
	char c=' ';
	while(c>'9'||c<'0'){
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
    if(x>9) write(x/10);
    putchar(x%10+'0');
    return ;
}
ll qpow(ll x,ll y){
    ll res=1;
    while(y>0){
        if(y&1) res=res*x%mod;
        y/=2;
        x=x*x%mod;
    }
    return res;
}
ll C(ll x,ll y){return fac[x]*inv[x-y]%mod*inv[y]%mod;}
int main(){
    freopen("defeat.in","r",stdin);
    freopen("defeat.out","w",stdout);
    n=read();
    k=read();
    p=read();
    for(int i=1;i<=n;i++) a[i]=read();
    for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mod;
    inv[n]=qpow(fac[n],mod-2);
    for(int i=n-1;i>0;i--) inv[i]=inv[i+1]*(i+1)%mod;
    if(p==0){
        for(int i=1;i<=n;i++){
            a[i]+=sum;
            if(a[i]<k){
                ans+=k-a[i];
                sum+=k-a[i];
            }else{
                ans+=a[i]-k;
                sum-=a[i]-k;
            }
        }
        cout<<ans<<endl;
    }else cout<<n<<endl;
    return 0;
}