#include #define rep(i,n)for(long long i=0;i<(long long)(n);++i) #define all(a) a.begin(), a.end() using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } const ll MOD=1000000007; const ll INF=1e18; const int MAX=510000; const double pi=acos(-1); int dx[8] = {1,0,-1,0,1,1,-1,-1}; int dy[8] = {0,1,0,-1,-1,1,1,-1}; int main(){ cin.tie(0); ios::sync_with_stdio(false); int p1,p2,n; cin >> p1 >> p2 >> n; int booking[1000]={}; rep(i,n){ int r; cin >> r; booking[r]++; } int num = 0; rep(i,1000){ num += max(0,booking[i]-1); } cout << num*(p1+p2) << endl; return 0; }