#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, x;
  while (~scanf("%d%d%d", &n, &k, &x)) {
    int in[108];
    for (int i = 0; i < n; i++) scanf("%d", &in[i]);
    sort(in, in + n);
    int ans = 0;
    for (int i = n - 1; i >= n - k; i--) ans += min(x, in[i]);
    for (int i = 0; i < n - k; i++) ans += in[i];
    cout << ans << endl;
  }
  return 0;
}
