#include <bits/stdc++.h> using namespace std; using ll = long long; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<class T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; int main() { ll k, n, m, A, B; cin >> k >> n >> m >> A >> B; vector<ll> list_k(k, 0); for(ll i = 0; i < k; i++){ cin >> list_k[i]; } vector<ll> list_n(n, 0); for(ll i = 0; i < n; i++){ cin >> list_n[i]; } vector<ll> list_m(m, 0); for(ll i = 0; i < m; i++){ cin >> list_m[i]; } ll mul = max(m - n, 0LL); ll cost = list_k[0] * min(m, n); if(mul > 0){ cost += A + B * mul; } cout << cost << endl; }