Make Towers Equal

// Pratiyush Mishra

#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define pl pair<ll,ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) memset(a, -1, sizeof(a))
#define popf pop_front
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " " << y << '\n'
#define p3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define printv(v)                   \
  for (ll i = 0; i < v.size(); ++i) \
    cout << v[i] << " ";            \
  cout << '\n'
#define pr1(x) cout << fixed << setprecision(15) << x << '\n'
#define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val)  no. of elements strictly less than val
// s.find_by_order(i)  itertor to ith element (0 indexed)
#define mod 1000000007
#define mod1 998244353
#define fio                         \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define get(n) \
  ll n;        \
  cin >> n
#define getvec(v, n)         \
  vector<ll> v(n);           \
  for (ll i = 0; i < n; i++) \
    cin >> v[i];
#define getstr(s) \
  string s;       \
  cin >> s
#define all(x) x.begin(), x.end()
#define countBits(x) __builtin_popcount(x)
using namespace std;

ll a, b, c, n;
vector<ll> v;

ll solve(ll h)
{
    ll extra = 0;
    ll ans = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        if (v[i] >= h)
        {
            extra += (v[i] - h);
            continue;
        }
        ll req = h - v[i];
        if (a + b <= c)
        {
            ll curr = (req * a) % mod;
            ans = (ans + curr) % mod;
            continue;
        }
        if (req <= extra)
        {
            ll curr = (c * req) % mod;
            ans = (ans + curr) % mod;
            extra -= req;
        }
        else
        {
            ll curr = (c * extra) % mod;
            ll diff = req - extra;
            curr = (curr + (diff * a) % mod) % mod;
            ans = (ans + curr) % mod;
            extra = 0;
        }
    }
    ans = (ans + (extra * b) % mod) % mod;
    return ans;
}

void mainSolve()
{
    cin >> n >> a >> b >> c;
    v.clear();
    v.resize(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    sort(v.begin(), v.end());
    ll l = v[0];
    ll h = v[n - 1];
    if (l == h)
    {
        p1(0);
        return;
    }
    ll ans = INT_MAX;
    while (l < h)
    {
        ll mid = (l + h) / 2ll;
        ll l_solve = solve(mid);
        ll r_solve = solve(mid + 1);
        ans = min(ans, min(l_solve, r_solve));
        if (l_solve  > r_solve)
            l = mid + 1;
        else
            h = mid;
    }
    p1(ans);
}

int main()
{
    fio;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    get(t);
    //ll t = 1;
    while (t--)
    {
        mainSolve();
    }
    return 0;
}