#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
    int p1,p2,n;
    cin>>p1>>p2>>n;
    vector<int>r(n);
    set<int>se;
    int ans=0;
    rep(i,n){
        cin>>r[i];
        if(se.find(r[i])==se.end()){
            se.insert(r[i]);
        }
        else{
            ans+=p1+p2;
        }
    }
    cout<<ans<<endl;
}