#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n, x; cin >> n >> x;
    ll s[n];
    ll sum = 0;
    rep(i,n){
        cin >> s[i];
        sum += s[i];
    }
    ll ans = sum - (n-1)*x;
    cout << ans << endl;
    return 0;
}