n , k , x = map(int , input().split())
l = input().split()
for i in range(len(l)):
l[i]=int(l[i])
count = 0
for i in range(len(l)-k):
count+=l[i]
print(count+(k*x))#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int n,k,x;
int a;
scanf("%d%d%d",&n,&k,&x);
int sum=0;
for(int i=0;i<n-k;i++)
{
scanf("%d",&a);
sum+=a;
}
for(int i=0;i<k;i++)
{
scanf("%d",&a);
sum+=x;
}
cout << sum << endl;
return 0;
}
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |
1296B - Food Buying | 133A - HQ9+ |
1650D - Twist the Permutation | 1209A - Paint the Numbers |
1234A - Equalize Prices Again | 1613A - Long Comparison |
1624B - Make AP | 660B - Seating On Bus |
405A - Gravity Flip | 499B - Lecture |