#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

#define PI 3.14159265
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main() {
    int p,n,k;
    cin>>p;
    while(p--){
        cin>>n>>k;
        cout<<(n % (k + 1) == 1 ? "Lose" : "Win")<<endl;
    }

    return 0;
}