#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

void solve() {
  int n, k;
  cin >> n >> k;

  vector<int> ls(n + 1);
  ls[n] = ls[n - 1] = 0;
  int nk = k;
  drep(i, n - 1) {
    if (nk) {
      ls[i] = 1;
      nk--;
    }
    else
      nk = k;

    // db(i, ls[i]);
  }
  if (ls[0])
    cout << "Win\n";
  else
    cout << "Lose\n";
}

int main() {
  int t;
  cin >> t;
  rep(ti, t) solve();
  return 0;
}