func_code_string: #include <bits/stdc++.h>   const int N = 7e3 + 5;   int n, k[2], a[2][N], cnt[2][N];   bool vis[2][N], win[2][N];   void dfs(int v, int now) {     if (vis[v][now]) return;     vis[v][now] = 1;     int u = v ^ 1;     for (int i = 1; i <= k[u]; ++i) {       int pre = (now - a[u][i] + n - 1) % n + 1;       if (pre == 1) continue;       if (!win[v][now]) {         win[u][pre] = 1;         dfs(u, pre);       } else if (++cnt[u][pre] == k[u]) {         win[u][pre] = 0;         dfs(u, pre);       }     }   }   int main() {     scanf( %d , &n);     for (int o = 0; o <= 1; ++o) {       scanf( %d , &k[o]);       for (int i = 1; i <= k[o]; ++i) scanf( %d , &a[o][i]);     }     dfs(0, 1), dfs(1, 1);     for (int o = 0; o <= 1; ++o) {       for (int i = 2; i <= n; ++i) {         if (!vis[o][i])           printf( %s%c ,  Loop ,    n [i == n]);         else           printf( %s%c , win[o][i] ?  Win  :  Lose ,    n [i == n]);       }     }     return 0;   }   