#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100005;
typedef long long ll;
const int inf = 0x3f3f3f3f;
int a[N];
ll p[N];
//容易看出每次取的是前i*j个最大的数
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
sort(a + 1, a + n + 1, greater<int>());
for(int i=1;i<=n;i++)
p[i] = p[i - 1] + a[i];
int x, y;
cin >> x >> y;
ll res = 0;
for (int i = 1; i <= x; i++)
for (int j = 1; j <= y; j++)
res += p[i*j];
cout << res;
return 0;
}