#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define ALL(a) (a).begin(),(a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 30);
typedef pair<ll,ll> pii;
struct Edge{ ll s,t,c; };
typedef vector<vector<Edge>> Graph;
typedef vector<pii> vpii;

int main() {
  ll p1,p2; cin>>p1>>p2;
  ll n; cin>>n;
  unordered_map<ll,ll> um;
  REP(i,n) {
    ll r; cin>>r;
    um[r]+=1;
  }
  ll ans=0;
  for(auto p:um) {
    ans+=(p.second-1)*(p1+p2);
  }
  cout<<ans<<endl;
}