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

#define pb push_back

using i128 = __int128;

int c, TC, n, m, k, b[100005], b_tmp[100005], idx[100005];
i128 a[100005], a0[100005];

void read(i128 &x){
	// read a __int128 variable
	char c; bool f = 0;
	while(((c = getchar()) < '0' || c > '9') && c != '-');
	if(c == '-'){f = 1; c = getchar();}
	x = c - '0';
	while((c = getchar()) >= '0' && c <= '9')x = x * 10 + c - '0';
	if(f) x = -x;
}

void write(i128 x){
	// print a __int128 variable
	if(x < 0){putchar('-'); x = -x;}
	if(x > 9)write(x / 10);
	putchar(x % 10 + '0');
}

i128 pow2[128];

bool is_on(i128 val, int bit) {
	return val % pow2[bit + 1] >= pow2[bit];
}

i128 f(int l, int r, int bit) {
	if (bit == -1) {
		return 0;
	}
	//~ cout << "AT " << l << ' ' << r << ' ' << bit << endl;
	if (is_on(a[l], bit) == is_on(a[r], bit)) {
		return pow2[bit] + f(l, r, bit - 1);
	} else {
		int pos = -1;
		for (int i = l; i <= r; i++) {
			if (is_on(a[i], bit)) {
				pos = i;
				break;
			}
		}
		assert(pos != -1 && l < pos && pos <= r);
		return max(f(l, pos - 1, bit - 1), f(pos, r, bit - 1));
	}
}

i128 get_max_x(int l, int r, int bit, i128 w) {
	if (bit == -1) {
		return 0;
	}
	if (is_on(a[l], bit) == is_on(a[r], bit)) {
		if (!is_on(a[l], bit)) {
			if (is_on(w, bit)) {			
				auto tmp = get_max_x(l, r, bit - 1, w);
				if (tmp == -1) {
					return -1;
				} else {
					return pow2[bit] + tmp;
				}
			} else {
				return pow2[bit + 1] - 1;
			}
		} else {
			if (is_on(w, bit)) {
				return get_max_x(l, r, bit - 1, w);
			} else {
				auto tmp = get_max_x(l, r, bit - 1, w);
				if (tmp == -1) {
					return pow2[bit] - 1;
				} else {
					return pow2[bit] + tmp;
				}
			}
		}
	} else {
		if (is_on(w, bit)) {
			return -1;
		}
		int lo = l, hi = r, pos = -1;
		while (lo <= hi) {
			int mid = (lo + hi) / 2;
			if (is_on(a[mid], bit)) {
				pos = mid;
				hi = mid - 1;
			} else {
				lo = mid + 1;
			}
		}
		auto l_tmp = get_max_x(l, pos - 1, bit - 1, w);
		auto r_tmp = get_max_x(pos, r, bit - 1, w);
		return max(l_tmp, r_tmp == -1 ? -1 : r_tmp + pow2[bit]);
	}
}

bool can(i128 w) {
	i128 cur_sum = 0;
	for (int i = n, r = n; i >= 1; i--) {
		cur_sum += b[i];
		while (cur_sum > m) {
			cur_sum -= b[r];
			r--;
		}
		if (i <= r) {
			//~ cout << "@ " << (int)w << " TRY " << i << ' ' << r << '\n';
			assert(!(i == 1 && r == n));
			assert(i == r);
			for (int j = 1; j < i; j++) {
				a[j] = a0[j];
			}
			for (int j = i; j <= n - (r - i + 1); j++) {
				a[j] = a0[j + r - i + 1];
			}
			auto x = get_max_x(1, n - (r - i + 1), k - 1, w);
			//~ cout << (int)w << " MAX X " << (int)x << '\n';
			if (x != -1 && x >= w - a0[i]) {
				//~ cout << "CAN " << (int)w << ' ' << i << ' ' << r << '\n';
				return 1;
			}
		}
	}
	return 0;
}

void solve() {
	scanf("%d %d %d", &n, &m, &k);
	for (int i = 1; i <= n; i++) {
		read(a0[i]);
	}
	i128 sum_b = 0;
	for (int i = 1; i <= n; i++) {
		scanf("%d", &b[i]);
		sum_b += b[i];
	}
	if (sum_b <= m) {
		// choose x = 2^k - 1
		i128 x = pow2[k] - 1;
		i128 ans = numeric_limits<i128>::max();
		for (int i = 1; i <= n; i++) {
			ans = min(ans, a0[i] + x);
		}
		write(ans);
		puts("");
		return;
	}
	iota(idx + 1, idx + 1 + n, 1);
	sort(idx + 1, idx + 1 + n, [&](const auto &lhs, const auto &rhs) {
		return a0[lhs] < a0[rhs];
	});
	//~ for (int i = 1; i <= n; i++) {
		//~ cout << idx[i] << ' ';
	//~ }
	//~ cout << '\n';
	for (int i = 1; i <= n; i++) {
		b_tmp[i] = b[idx[i]];
	}
	sort(a0 + 1, a0 + 1 + n);
	//~ for (int i = 1; i <= n; i++) {
		//~ write(a0[i]);
		//~ cout << ' ';
	//~ }
	//~ cout << '\n';
	copy(b_tmp + 1, b_tmp + 1 + n, b + 1);
	//~ for (int i = 1; i <= n; i++) {
		//~ cout << b[i] << ' ';
	//~ }
	//~ cout << '\n';
	for (int i = 1; i <= n; i++) {
		a[i] = a0[i];
	}
	i128 chc_f = f(1, n, k - 1);
	//~ cout << (int)chc_f << '\n';
	i128 lo = chc_f + 1, hi = pow2[k] - 1, ans = chc_f;
	while (lo <= hi) {
		i128 mid = (lo + hi) / 2;
		if (can(mid)) {
			ans = mid;
			lo = mid + 1;
		} else {
			hi = mid - 1;
		}
	}
	write(ans);
	puts("");
}

int main() {
	pow2[0] = 1;
	for (int i = 1; i <= 123; i++) {
		pow2[i] = pow2[i - 1] * 2;
	}
	scanf("%d %d", &c, &TC);
	while (TC--) {
		solve();
	}
}