#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

using namespace std;

int main() {
	int p1, p2, n, r;
	cin >> p1 >> p2 >> n;

	set<int> reserves;
	int loss = 0;
	for (int i = 0; i < n; i++) {
		cin >> r;
		if (reserves.count(r)) {
			loss += p1 + p2;
		} else {
			reserves.insert(r);
		}
	}
	cout << loss << endl;
	return 0;
}