#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int p1, p2, n;
    cin >> p1 >> p2 >> n;

    vector<int> r(n);
    REP(i, n)
    {
        cin >> r[i];
    }

    sort(ALL(r));


    int prev = 0;
    int wb = 0;
    REP(i, n)
    {
        if(r[i] == prev){
            wb++;
        }
        prev = r[i];
    }

    cout << (p1 + p2) * wb << endl;

}