#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

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

const int inf = 1000000009;

int main() {
    int p;
    scanf("%d", &p);
    for (int i = 0; i < p; i++) {
	int n, k;
	scanf("%d%d", &n, &k);
	printf("%s\n", (n%(k+1)==1) ? "Lose" : "Win");
    }
}