#include #include #include #include #include #include #include #include #include // set > s; // vector v(N); // for(int i =0;i> v.at(i); // } // single line with multi param // vector of vector // vector> data(row,vector(col)); // for(int row=0;row> data[row][col]; // }} // cout << std::fixed << std::setprecision(9) <()); // long long s = accumulate(A.begin(),A.end(),(long long)0); // unordered_mapm({{"SUN",1},{"MON",2},{"TUE",3},{"WED",4},{"THU",5},{"FRI",6},{"SAT",7}}); // max({A,B,C}); // S.substr(i,2)=="RS" // SS.erase (std::remove(SS.begin(), SS.end(), 'A'), SS.end()); //delete string // char c = 'a';string({c}); // transform(ret.begin(),ret.end(),ret.begin(),::toupper); // to be review // * abc139_b // * abc099_b // * abc090_a // * abc062_a // * abc032_a // * abc030_b // * abc027_b // * abc021_a // * abc018_a // * abc182_c // * abc181_c // * abc175_c // * abc170_c // * abc161_c // * abc154_c space O(1) // * abc151_c // * abc147_c // * abc113_c // * abc123_c // * abc115_c // * abc153_d // * abc120_c // * abc081_b // * arc108_b // * abc157_c // * sumitrust2019_c // * abc165_c // * abc031_d // * abc023_d // * agc021_a // * abc139_b // * agc041_a // * abc120_c // * arc073_c // * arc069_c // * agc014_a // * abc103_c // * agc017_a // * agc040_a // * agc028_a // * agc008_a // * agc007_a // * abc116_c // * abc064_c // * agc016_a // * agc034_a // * cf16_b // * abc188_e // * abc052_c // * abc110_d // * abc142_d // * arc067_c // * abc146_c // * abc061_c // * abc114_d // * abc114_c // * arc032_a // * arc034_c // * aoj_2706 // * aoj_DSL_3_D // * abc172_c // * arc084_c // * arc110_a // * apc001_a // * abc124_d // * arc106_b // * abc157_d // * agc046_a // * abc185_d // * arc044_a // * abc046_a // * abc039_c // * arc107_b // * arc054_a // * abc136_d // * arc051_a // * abc180_d // * abc190_d // * abc121_d // * abc038_c // * abc130_d // * abc127_d // * arc018_b // * arc001_c // * digitalarts2012_a // * code-festival-2015-quala_c // * abc192_d // * srm_StockHistory // * dp_i // * srm_BinaryFlips // * abc088_c // * past202004-open_d // * past201912-open_e // * past201912-open_h // * past202005-open_g // * abc161_d // * dp_a // * dp_e // * past202005-open_h // * tdpc_a // * past202004-open_h // * past201912-open_g // * past202005-open_c // * abc179_c // * arc107_a // * abc098_c // * abc194_c // * abc194_e // * abc146_c // * past202004_g // * typical_algorithm_b // * past201912_k // * past202005_i // * abc195_d // * past202005_m // * past201912_j // * abc099_c // * abc196_d // * arc115_a // * arc115_c // check list // * variable range // * immeditate value is int range(accumulate) // * index range(0 origin or 1 origin) // * input is complete? // * unued input // * loop initial value // * check variable range maximum and minimum // * misunderstand input(node Edge and node Vertex) // * check que front and back // * check not using INT_MAX but LONG_LONG_MAX // * modify element in graph retrieval // * dp initial value, max index+1 // * return value could be negative?(initial value 0 to INT_MIN) // * if value is gradually increasing, use bin search // * Time complexity limit 10^8 #include using namespace std; // https://www2.slideshare.net/Roadagain/ss-71620380 // https://github.com/kurokoji/.cpp-Template/blob/master/template/template.cpp #define int long long // check over flow // assert(a; using vvi = vector; using vvvi = vector; using pii = pair; using D = double; using P = complex; using vs = vector; template using PQ = priority_queue; template using minPQ = priority_queue, greater>; /* const */ const int INF = 1001001001; const ll LINF = 1001001001001001001ll; // const int MOD = 1e9 + 7; const D EPS = 1e-9; const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1}; /* func */ inline bool inside(int y, int x, int H, int W) { return y >= 0 && x >= 0 && y < H && x < W; } template inline T in() { T x; cin >> x; return (x); } inline vs split(const string& t, char c) { vs v; stringstream s(t); string b; while (getline(s, b, c)) if (b != "") v.eb(b); return v; } inline string join(const vs& ss, char c) { string s; for (int i = 0; i < (int)ss.size(); i++) { s += (i != (ll)ss.size() - 1 ? ss[i] + c : ss[i]); } return s; } template inline bool chmin(T& a, const T& b) { if (a > b) a = b; return a > b; } template inline bool chmax(T& a, const T& b) { if (a < b) a = b; return a < b; } template using min_priority_queue = priority_queue, greater>; template inline void print(const pair& p) { cout << p.first << " " << p.second << endl; } template inline void print(const T& x) { cout << x << '\n'; } template inline void print(const vector>& v) { for (auto&& p : v) print(p); } template inline void print(const vector& v, string s = " ") { for (int i = 0; i < v.size(); i++) cout << v[i] << (i != (long long)v.size() - 1 ? s : "\n"); } template inline void print(const T& b, const T& e, string s = " ") { for (auto i = b; i != e; i++) print(*i); } template void pprint(T const& a) { std::cout << " " << a; } template void pp(Args... args) { using swallow = std::initializer_list; (void)swallow{(void(pprint(args)), 0)...}; cout << endl; } template inline unordered_map counter(const vector& v) { unordered_map m; for (int i = 0; i < v.size(); i++) m[v[i]]++; return m; } inline unordered_map counter(const string& v) { unordered_map m; for (int i = 0; i < (long long)v.size(); i++) m[v[i]]++; return m; } // clang-format on /* }}} */ string enc(long long i, long long j) { return to_string(i) + " " + to_string(j); } uint64_t combinations2(uint64_t n, uint64_t k) { uint64_t r = 1; for (uint64_t d = 1; d <= k; ++d) { r *= n--; r /= d; } return r; } #define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i)) #define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i)) #define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i)) #define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i)) #define ALL(x) ::std::begin(x), ::std::end(x) using namespace std; vector v; string rec(int N,int K){ if((N-1)%(K+1)==0)return "Lose"; return "Win"; } vector solve(int P,vector N, vector K) { vector ret; REP(i,P){ v.assign(N[i]+1,""); ret.push_back(rec(N[i],K[i])); } return ret; } // generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator) signed main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); constexpr char endl = '\n'; int P; cin >> P; vector N(P), K(P); REP (i, P) { cin >> N[i] >> K[i]; } auto ans = solve(P, N, K); REP (i, P) { cout << ans[i] << endl; } return 0; }