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

void solve()
{
	int n, c1, c2;
	cin >> n >> c1 >> c2;
	int s1 = 0;
	int d = 0;
	for(int i = 0; i < n; i ++)
	{
		string t;
		cin >> t;
		if(t[0] == t[1] || t[1] == t[2] || t[0] == t[2])
			d ++;
	}
	int plan1 = n * 3 * c1;
	int plan2 = d * c2 + d * c1 + (n - d) * 3 * c1;
	int plan3 = d * n * 2 * c2 + (n - d) * c2 * 3;
	cout << min(min(plan1, plan2), plan3) << endl;
}


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