#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

void solve(){
    int N, K;
    cin >> N >> K;
    vector<int> dp(N + 1, -1);
    auto func = [&](auto&& self, int i) -> int {
        if(dp[i] != -1) return dp[i];
        if(i == N)  return dp[i] = 1;
        int res = 0;
        for(int j = 1; j <= min(K, N - i); ++j){
            res |= self(self, i + j) ^ 1;
        }
        return dp[i] = res;
    };
    cout << (func(func, 0) ? "Win\n" : "Lose\n");
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--)  solve();

    return 0;
}