#include<bits/stdc++.h>
using namespace std;
#define int         long long
#define ull         unsigned long long
#define ll      long long
#define N       100005
#define M       1000000007
#define pb      push_back
#define p_q         priority_queue
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pii>
#define mi          map<ll,ll>
#define mii         map<pii,ll>
#define all(a)      (a).begin(),(a).end()
#define sz(x)       (ll)x.size()
#define endl        '\n'
#define gcd(a,b)    __gcd((a),(b))
#define lcm(a,b)    ((a)*(b)) / gcd((a),(b))
#define ios     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp      make_pair
#define lb      lower_bound
#define ub      upper_bound
#define F           first
#define S           second
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ini(a,n,b)  for(ll int i=0;i<n;i++) a[i]=0;
#define cset(a)     __builtin_popcountll(a)
#define hell        (ull)1e9
#define re      resize


signed main(void)
{ios
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
    #endif
    int TESTS=1;
    cin>>TESTS;
    while(TESTS--)
    {
        int n;
        cin>>n;
        int a[n],b[n];
        rep(i,0,n) cin>>a[i];
        rep(i,0,n) cin>>b[i];
        sort(a,a+n);
        sort(b,b+n);
        bool ok=1;
        rep(i,0,n)
        {   if(a[i]>=b[i])
            {
                ok=0;
                break;
            }
        }
        if(ok) cout<<"WIN"<<endl;
        else    cout<<"LOSE"<<endl;
    }

}