#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int mod = 1e9+7;

int main() {
  int p1, p2; cin >> p1 >> p2;
  map<int, int> mp;
  int n; cin >> n;
  int ans = 0;
  for(int i=0; i<n; i++){
    int a; cin >> a;
    if( mp.find(a) == mp.end() ){
      mp[a] = 1;
    }else ans += p1 + p2;
  }
  cout << ans << endl;

  return 0;
}

// EOF