#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <string>

using namespace std;

void solve();

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}

void solve() {
    int p1,p2;
    cin >> p1 >> p2;
    int n;
    cin >> n;
    int r[n];
    for(int i = 0; i < n; i++) {
        cin >> r[i];
    }
    map<int,bool> m;
    int count = 0;
    for(int i = 0; i < n; i++) {
        if(m[r[i]]) count++;
        m[r[i]] = true;
    }
    cout << (p1 + p2) * count << endl;
}