#include <bits/stdc++.h>
 
using namespace std;
 
const int MaxN = (int)1e5 + 10;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
 
int n, m;
int a[MaxN], b[MaxN];
 
int main() {
//	freopen("input.txt", "r", stdin);
	int t;
	scanf("%d", &t);
	while (t --> 0) {
		scanf("%d%d", &n, &m);
		assert (1 <= n && n <= 1e2);
		assert (1 <= m && m <= 1e2);
		for (int i = 1; i <= n; ++i) {
			scanf("%d", &a[i]);
			assert (0 <= a[i] && a[i] <= INF);
		}
		for (int i = 1; i <= m; ++i) {
			scanf("%d", &b[i]);
			assert (0 <= b[i] && b[i] <= INF);
		}
		sort(a + 1, a + n + 1, greater <int>());
		sort(b + 1, b + m + 1, greater <int>());
		while (n > 0 && a[n] == 0) --n;
		while (m > 0 && b[m] == 0) --m;
		bool ok = n == m;
		for (int i = 1; i <= n && i <= m; ++i) {
			ok &= a[i] == b[i];
		}
		if (ok) {
			cout << "Bob\n";
		} else {
			cout << "Alice\n";
		}
   }
	return 0;
}