#include <bits/stdc++.h>
using namespace std;
int n, x, k;
priority_queue<int> q;
int main() {
  scanf("%d%d%d", &n, &k, &x);
  for (int i = 0; i < n; i++) {
    int a;
    scanf("%d", &a);
    q.push(a);
  }
  int sol = 0;
  while (!q.empty()) {
    if (k > 0 and q.top() > x) {
      sol += x;
      k--;
    } else
      sol += q.top();
    q.pop();
  }
  cout << sol;
  return 0;
}
