#include <bits/stdc++.h>
#define IAKIOI ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define int long long

const long long mod = 1e9 + 7, E = 1e6 + 1;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ull, ull> puu;

ull a[E], b[E];

void solve() {
	ull l, n, q;
	cin >> l >> n >> q;
	for (ull i = 1; i <= n; i++) cin >> a[i];
	for (ull i = 1; i <= n; i++) cin >> b[i];
	while (q--) {
		ull x;
		cin >> x;
		ull op = lower_bound(a + 1, a + 1 + n, x) - a;
		ull ans = b[op - 1] + (x - a[op - 1]) * 1.0 * ((long double)(b[op] - b[op - 1]) / a[op] - a[op - 1]);
		cout << ans << ' ';
	}
	cout << '\n';
}

signed main() {
	IAKIOI;
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}

样例没过awa