fn read<T: std::str::FromStr>() -> T {
  let mut s = String::new();
  std::io::stdin().read_line(&mut s).ok();
  s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn main() {
  let p: usize = read();
  let nk_list = (0..p).map(|_| {
    let pair: Vec<u32> = read_vec();
    (pair[0], pair[1])
  }).collect();
  println!("{}", no8(p, nk_list));
}

fn no8(_p: usize, nk_list: Vec<(u32, u32)>) -> String {

  use std::collections::HashMap;

  fn judge(n:u32, k:u32, cache: &mut HashMap<(i64, i64), bool>) -> bool {
    let mut must = n as i64 - 1;
    let k = k as i64;
    if let Some(result) = cache.get(&(must, k)) {
      dbg!(&result);
      return *result;
    }
    loop {
      if must - k - 1 <= 0 {
        break;
      }
      must = must - k - 1;
      if let Some(result) = cache.get(&(must, k)) {
        dbg!(&result);
        return *result;
      }
    }
    let result = must <= k;
    cache.insert((must, k), result);
    result
  }

  let mut cache = HashMap::new();

  let result = nk_list.iter().map(move |nk| if judge(nk.0, nk.1, &mut cache) { "Win" } else { "Lose" }).collect::<Vec<&str>>();

  result.join("\n")
}