#include <iostream>
#include <algorithm>
using namespace std;

int main() {
  int i, p1, p2, n;
  int count = 0;

  cin >> p1 >> p2 >> n;
  int R[n];

  for (i = 0; i < n; i++) {
    cin >> R[i];
  }

  sort(R, R + n);
  for (i = 0; i < n; i++) {
    if (i > 0 && R[i] == R[i - 1]) {
      count++;
    }
  }

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

  return 0;
}