#include<bits/stdc++.h>
using namespace std;
using Int=long long;
using Real=long double;
template<class T,class S>inline bool chmin(T&A,S B){if(A>B){A=B;return true;}else{return false;}}
template<class T,class S>inline bool chmax(T&A,S B){if(A<B){A=B;return true;}else{return false;}}
#define REP(i,n)for(int i=0;i<(n);++i)
#define REP1(i,n)for(int i=1;i<=(n);++i)
#define ALL(x)begin(x),end(x)
#define drop(x){cout<<(x)<<'\n';return;}
int P1,P2,N,R[101],ans;
void sol()
{
	cin>>P1>>P2>>N;
	REP(i,N)cin>>R[i];
	sort(R,R+N);
	for(int i=0,j=0;i<N;i=j)
	{
		while(j<N&&R[i]==R[j])++j;
		ans+=(P1+P2)*(j-i-1);
	}
	cout<<ans<<"\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cout<<fixed<<setprecision(16);
	int TE=1;
	//cin>>TE;
	while(TE--)sol();
}