#![allow(unused_imports)] #![allow(non_snake_case)] use std::collections::VecDeque; #[allow(unused_macros)] macro_rules! read { ([$t:ty] ; $n:expr) => ((0..$n).map(|_| read!([$t])).collect::>()); ($($t:ty),+ ; $n:expr) => ((0..$n).map(|_| read!($($t),+)).collect::>()); ([$t:ty]) => (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::>()); ($t:ty) => (rl().parse::<$t>().unwrap()); ($($t:ty),*) => {{ let buf = rl(); let mut w = buf.split_whitespace(); ($(w.next().unwrap().parse::<$t>().unwrap()),*) }}; } #[allow(dead_code)] fn rl() -> String { let mut buf = String::new(); std::io::stdin().read_line(&mut buf).unwrap(); buf.trim_end().to_owned() } trait IteratorExt: Iterator + Sized { fn vec(self) -> Vec { self.collect() } } impl IteratorExt for T {} fn main() { let p = read!(usize); let m = read!(usize, usize; p); let mut v: Vec = vec![]; for (n, k) in m { let remainder = n%(k+1); if remainder == 1 { v.push(false); } else { v.push(true); } } let mut s = String::new(); for e in v { if e { s.push_str("Win\n"); } else { s.push_str("Lose\n"); } } print!("{}", s); }