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

using ll = long long;

void solve() {
    int n, a, b;
    cin >> n >> a >> b;

    vector<ll> x(n), y(n), w(n);

    for (int i = 0; i < n; i++) cin >> x[i];
    for (int i = 0; i < n; i++) cin >> y[i];
    for (int i = 0; i < n; i++) cin >> w[i];

    map<pair<ll, ll>, ll> mp;

    ll ans = 0;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            ll X = x[j] - a * x[i] + b * y[i];
            ll Y = y[j] - b * x[i] - a * y[i];

            mp[{X, Y}] += w[i];
            ans = max(ans, mp[{X, Y}]);
        }
    }

    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}