#include <bits/stdc++.h>
using namespace std;

long long gcd(long long x, long long y)
{
    if (y == 0)
        return x;
    return gcd(y, x % y);
}

long long lcm(long long x, long long y)
{
    if (x == 0 || y == 0)
        return 0;
    return x / gcd(x, y) * y;
}

int main()
{
    int P1, P2;
    cin >> P1 >> P2;
    int N;
    cin >> N;
    vector<int> R(1000, 0);
    for (int i = 0; i < N; i++)
    {
        int r;
        cin >> r;
        R[r]++;
    }
    long ans = 0;
    for (int i = 0; i < 1000; i++)
    {
        if (R[i] > 1)
        {
            ans += (P1 + P2) * (R[i] - 1);
        }
    }
    cout << ans << endl;
}