#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; constexpr double PI = 3.14159265358979323846; int main(){ int p,q; cin >> p >> q; int n; cin >> n; set st; rep(i,n){ int a; cin >> a; st.insert(a); } cout << (p+q) * (n-st.size()) << endl; return 0; }