#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

inline int fastInput() {
    int x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') {
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

int main()
{
    int T;
    T = fastInput();
    while(T--)
    {
        int n, m;
        int aa = 0, bb = 0;
        n = fastInput();
        m = fastInput();
        
        vector<pair<int, int>> v;
        for(int i = 0; i < n; i++)
        {
            int x;
            x = fastInput();
            v.push_back({x, 0});
            aa++;
        }
        for(int i = 0; i < m; i++)
        {
            int x;
            x = fastInput();
            v.push_back({x, 1});
            bb++;
        }
        
        sort(v.begin(), v.end());
        
        for(int i = 1; i < v.size(); i++)
        {
            if(v[i].second == 1)
            {
                for(int j = i - 1; j >= 0; j--)
                {
                    if(v[j].first == v[i].first && v[j].second == 0)
                    {
                        v.erase(v.begin() + j);
                        aa--;
                    }
                    else
                    {
                        break;
                    }
                }
            }
            if(v[i].second == 1 && v[i - 1].second == 1)
            {
                v.erase(v.begin() + i - 1);
            }
        }
        
        if(aa <= 0)
        {
            printf("Impossible\n");
            continue;
        }
        
        int l = 0, r = 0;
        int maxn = 0;
        
        for(int i = 0; i < v.size(); i++)
        {
            if(v[i].second == 1 || i == v.size() - 1)
            {
                r = i;
                maxn = max(maxn, r - l);
                l = i;
            }
        }
        
        printf("%d\n", maxn - 1);
    }
}