#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define pb push_back
#define all(x) begin(x),end(x)
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    int a,b,n,sum=0;
    cin>>a>>b>>n;
    vector<P> c(n);
    for(int i=0;i<n;i++){
        cin>>c[i].first;
    }
    sort(all(c));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(c[i].first==c[j].first) c[i].second++;
        }
        if(c[i].second>1) {
            sum+=(c[i].second-1)*(a+b);
            i+=c[i].second-1;
            
        }
        }
    cout<<sum<<endl;
    return 0;
}