#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1)); 
int a,b,n,c;
bool li[1010];

int main(){
	cin >> a >> b >> n;
	int s=0;
	REP(i,0,n){
		cin >> c;
		if(li[c]) s+=a+b;
		else li[c]=true;
	}
	
	cout << s << endl;
	return 0;
}