#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
const int N = 2e5 + 10;
vector <int> a(N);
vector <int> b(N);
void solve() 
{
	int n, m;
	std:: cin >> n >> m;
	for(int i = 1; i <= n; i ++ )
	{
		std:: cin >> a[i];
	}
	for(int i = 1; i <= m; i ++ )
	{
		std:: cin >> b[i];
	}

	std:: sort(a.begin() + 1, a.begin() + 1 + n);
	std:: sort(b.begin() + 1, b.begin() + 1 + m);

	b[0] = -1;
	b[m + 1] = 1e18;
	a[n + 1] = 1e18;
	int ans = 0;
	for(int i = 0; i <= m; i ++ )
	{
		int l = upper_bound(a.begin() + 1, a.begin() + 1 + n, b[i]) - (a.begin());
		if(l == n + 1)
		continue;
		int r = lower_bound(a.begin() + 1, a.begin() + 1 + n, b[i + 1]) - (a.begin());
		if(r == n + 1)
		{
			r = n;
		}
		else
		{
			while(r >= 0 && b[i + 1] <= a[r])
			{
				r -- ;
			}
		}
		ans = max(ans, r - l + 1);
	}
	if(ans == 0)
	{
		std:: cout << "Impossible" << endl;
		return ;
	}
	std:: cout << ans << endl;
	b[0] = 0;
	b[m + 1] = 0;
	a[n + 1] = 0;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
    int T;
    std:: cin >> T;
    while(T -- )
	solve();
	return 0;
}