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

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()


void solve() {
    int n, m, Q;
    cin >> n >> m >> Q;
    vector<int> a(n), b(n), c(m), d(m);
    for (int &i : a) cin >> i;
    for (int &i : b) cin >> i;
    for (int &i : c) cin >> i;
    for (int &i : d) cin >> i;
    vector<double> p(n), q(m), prp(n), prq(m), sfp(n), sfq(m);
    while (Q--) {
        int x, y;
        cin >> x >> y;
        double l = 0, r = 2000;
        for (int it = 0; it < 80; it++) {
            double md = (l + r) / 2.0;
            for (int i = 0; i < n; ++i) 
                p[i] = a[i] - b[i] * md;
            for (int i = 0; i < m; ++i) 
                q[i] = d[i] * md - c[i];
            for (int i = 0; i < n; ++i) {
                if (i % x == 0) prp[i] = p[i];
                else prp[i] = min(prp[i - 1], p[i]);
            }
            reverse(all(p));
            for (int i = 0; i < n; ++i) {
                if (i % x == 0) sfp[i] = p[i];
                else sfp[i] = min(sfp[i - 1], p[i]);
            }
            reverse(all(p)), reverse(all(sfp));
            for (int i = 0; i < m; ++i) {
                if (i % y == 0) prq[i] = q[i];
                else prq[i] = max(prq[i - 1], q[i]);
            }
            reverse(all(q));
            for (int i = 0; i < m; ++i) {
                if (i % y == 0) sfq[i] = q[i];
                else sfq[i] = max(sfq[i - 1], q[i]);
            }
            reverse(all(q)), reverse(all(sfq));
            double mn = -1e9, mx = 1e9;
            for (int i = 0; i + x - 1 < n; ++i)
                mn = max(mn, min(sfp[i], prp[i + x - 1]));
            for (int i = 0; i + y - 1 < m; ++i)
                mx = min(mx, max(sfq[i], prq[i + y - 1]));
            if (mn >= mx) l = md;
            else r = md;
        }
        cout << setprecision(9) << fixed << l << '\n';
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin >> T;
    while (T--) solve();
}