#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, a, b) for (int i = a; i < (b); i++)
#define FOR(i, n) for (int i = n; i >= 0; i--)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define SIZE 100001
#define MOD 1000000007
#define INF 100000000
using namespace std;

int main() {
  int p;
  cin >> p;

  REP(i, p) {
    int n, k;
    cin >> n >> k;

    if ((n - 1) % (k + 1) == 0)
      cout << "Lose" << endl;
    else
      cout << "Win" << endl;
  }

  return 0;
}