Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every <image> the condition ai ≥ ai - 1 is met, so the sequence is sorted.

Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of ai (<image>).

Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously.

Input

The first line contains three integers n, k, x (1 ≤ k ≤ n ≤ 100, 1 ≤ x ≤ 99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself.

The second line contains n integer numbers ai (2 ≤ ai ≤ 100) — the time Luba has to spend to do i-th chore.

It is guaranteed that <image>, and for each <image> ai ≥ ai - 1.

Output

Print one number — minimum time Luba needs to do all n chores.

Examples

Input

4 2 2
3 6 7 10


Output

13


Input

5 2 1
100 100 100 100 100


Output

302

Note

In the first example the best option would be to do the third and the fourth chore, spending x = 2 time on each instead of a3 and a4, respectively. Then the answer is 3 + 6 + 2 + 2 = 13.

In the second example Luba can choose any two chores to spend x time on them instead of ai. So the answer is 100·3 + 2·1 = 302.
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.Scanner;
import java.util.function.Function;
import java.util.stream.Collectors;
public class _p000873A {
    static public void main(final String[] args) throws IOException {
        p000873A._main(args);
    }
//begin p000873A.java
static private class p000873A extends Solver{public p000873A(){nameIn="p000873A.in"
;singleTest=true;}int n;int k;int x;int[]a;@Override protected void solve(){pw.println
(k*x+Arrays.stream(a,0,n-k).sum());}@Override public void readInput()throws IOException
{n=sc.nextInt();k=sc.nextInt();x=sc.nextInt();if(sc.hasNextLine()){sc.nextLine()
;}a=Arrays.stream(sc.nextLine().trim().split("\\s+")).mapToInt(Integer::valueOf)
.toArray();}static public void _main(String[]args)throws IOException{new p000873A
().run();}}
//end p000873A.java
//begin net/leksi/contest/Solver.java
static private abstract class Solver{protected String nameIn=null;protected String
nameOut=null;protected boolean singleTest=false;protected boolean preprocessDebug
=false;protected boolean doNotPreprocess=false;protected Scanner sc=null;protected
PrintWriter pw=null;private void process()throws IOException{if(!singleTest){int
t=lineToIntArray()[0];while(t-->0){readInput();solve();}}else{readInput();solve(
);}}abstract protected void readInput()throws IOException;abstract protected void
solve()throws IOException;protected int[]lineToIntArray()throws IOException{return
Arrays.stream(sc.nextLine().trim().split("\\s+")).mapToInt(Integer::valueOf).toArray
();}protected long[]lineToLongArray()throws IOException{return Arrays.stream(sc.nextLine
().trim().split("\\s+")).mapToLong(Long::valueOf).toArray();}protected String joinToString
(final int[]a){return Arrays.stream(a).mapToObj(Integer::toString).collect(Collectors
.joining(" "));}protected String joinToString(final long[]a){return Arrays.stream
(a).mapToObj(Long::toString).collect(Collectors.joining(" "));}@Deprecated protected
String intArrayToString(final int[]a){return joinToString(a);}@Deprecated protected
String longArrayToString(final long[]a){return joinToString(a);}protected<T>String
joinToString(final T[]a){return Arrays.stream(a).map(v->v.toString()).collect(Collectors
.joining(" "));}protected<T>String joinToString(final T[]a,final Function<T,String>
toString){return Arrays.stream(a).map(v->v.toString()).collect(Collectors.joining
(" "));}protected<T>String joinToString(final Collection<T>a){return a.stream().map
(v->v.toString()).collect(Collectors.joining(" "));}protected<T>String joinToString
(final Collection<T>a,final Function<T,String>toString){return a.stream().map(v->
toString.apply(v)).collect(Collectors.joining(" "));}@Deprecated protected List<Long>
longArrayToList(final long[]a){return Arrays.stream(a).mapToObj(Long::valueOf).collect
(Collectors.toList());}@Deprecated protected List<Integer>intArrayToList(final int
[]a){return Arrays.stream(a).mapToObj(Integer::valueOf).collect(Collectors.toList
());}protected List<Long>intArrayToLongList(final int[]a){return Arrays.stream(a
).mapToObj(Long::valueOf).collect(Collectors.toList());}protected List<Integer>toList
(final int[]a){return Arrays.stream(a).mapToObj(Integer::valueOf).collect(Collectors
.toList());}protected List<Long>toList(final long[]a){return Arrays.stream(a).mapToObj
(Long::valueOf).collect(Collectors.toList());}protected void run()throws IOException
{boolean done=false;if(nameIn !=null){try{try(FileInputStream fis=new FileInputStream
(nameIn);PrintWriter pw0=select_output();){done=true;sc=new Scanner(fis);pw=pw0;
process();}}catch(IOException ex){}}if(!done){try(PrintWriter pw0=select_output(
);){sc=new Scanner(System.in);pw=pw0;process();}}}private PrintWriter select_output
()throws FileNotFoundException{if(nameOut !=null){return new PrintWriter(nameOut
);}return new PrintWriter(System.out);}}
//end net/leksi/contest/Solver.java
}
