#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <cmath>
#include <utility>
#include <queue>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <complex>
#define REP(i,n) for(int i=0;i<n;i++)
#define ESP 1e-11
using namespace std;
typedef long long int ll;



int main(){
    int ans =0 ;
    int N;
    cin >> N;
    for(int i=0;i<N;i++){
        int n,k;
        cin >> k >> n;
        int ama = (k-1) % (n+1);
        if (0<ama and ama<=n) {
            //ans++;
            cout << "Win"<<endl;
        }
        //if(ans)cout << "Win"<<endl;
        else cout << "Lose"<<endl;
    }
    //cout << ans << endl;
}