#include<bits/stdc++.h>

const char *bin = "ensw";

const int dx[] = {,, ,-};

const int dy[] = {,,-, };

const int maxn = ;//1+...20

const int o = ;

const int N = ;

const int nxt_dir[][] = {{,},{,},{,},{,},{,,,}};

const int deg[] = {,,,,};

int vis[maxn][maxn];

int n;

int sum[N];

int left[N];

int path[N];

int cnt;

void dfs(int x,int y,int d,int dir)

{

    if(d++ == n ){

        if(x == o && y == o){

            for(int i = ; i < n; i++){

                printf("%c",bin[path[i]]);

            }

            putchar('\n');

            cnt++;

        }

        return ;

    }

    for(int i = ; i < deg[dir]; i++){

        int j = nxt_dir[dir][i];

        int nx = x+dx[j]*d, ny = y+dy[j]*d;

        if(vis[nx][ny]) continue;

        if(abs(nx-o) + abs(ny-o) > left[d]) continue;

        bool flag = false;

        if(j == || j == ){

             for(int tx = x+dx[j]; tx != nx ; tx+=dx[j]){

                if(!~vis[tx][y]) {flag = true; break;}

            }

        }else {

            for(int ty = y+dy[j]; ty != ny ; ty+=dy[j]){

                if(!~vis[x][ty]) {flag = true; break;}

            }

        }

        if(flag) continue;

        path[d-] = j;

        vis[nx][ny] = ;

        dfs(nx,ny,d,j);

        vis[nx][ny] = ;

    }

}

int main()

{

  //  freopen("in.txt","r",stdin);

    int T;

    scanf("%d",&T);

    for(int i = ; i < N; i++)

        sum[i] = sum[i-]+i;

    while(T--){

        int k;

        scanf("%d%d",&n,&k);

        if(((n>>)&)^(n&)) { printf("Found 0 golygon(s).\n\n"); continue; }

        int tx,ty;

        memset(vis,,sizeof(vis));

        for(int i = ; i < k; i++){

            scanf("%d%d",&tx,&ty);

            if(abs(tx)<o && abs(ty)<o ) vis[tx+o][ty+o] = -;

        }

        for(int i = ; i < n; i++)

            left[i] = sum[n] - sum[i];

        cnt = ;

        dfs(o,o,,);

        printf("Found %d golygon(s).\n\n",cnt);

    }

    return ;

}