#include <bits/stdc++.h>
using namespace std;
int main() {
  long long i, n, k, x, ans = 0;
  cin >> n >> k >> x;
  int arr[n];
  for (i = 0; i < n; i++) {
    cin >> arr[i];
    ans += arr[i];
  }
  sort(arr, arr + n);
  int antiK = 0;
  for (i = n - 1; i >= 0; i--) {
    if (k == antiK) break;
    if (x < arr[i]) {
      antiK++;
      ans = ans - arr[i] + x;
    }
  }
  cout << ans << endl;
  return 0;
}
