#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

typedef long long int lld;
typedef pair<int,int> PII;

const int INF = (1<<31)-1;
const lld LINF = (1LL<<63)-1;

const int NMAX = 100000+5;
const int MMAX = 100000+5;
const int KMAX = 100000+5;
const int PMAX = 100000+5;
const int LMAX = 100000+5;
const int VMAX = 100000+5;

int Me[15][15],Enemy[15][15];
int Total_me,Total_en;
int x,y,i,lx,ly;
char answer[50];

void Adauga(int x,int y,int t,int lenght)
{
    if(t==1)
        for(int i=x; i<=x+lenght-1; i++) Me[i][y]=1;
    else
        for(int i=y; i<=y+lenght-1; i++) Me[x][i]=1;
}

int main()
{
    srand(time(NULL));

    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    printf("3 2 1\n");
    Adauga(3,2,1,2);
    printf("1 1 0\n");
    Adauga(1,1,0,3);
    printf("10 6 0\n");
    Adauga(10,6,0,3);
    printf("6 9 1\n");
    Adauga(6,9,1,4);
    printf("3 4 0\n");
    Adauga(3,4,0,5);

    Total_me=Total_en=17;

    printf("2 2\n");

    x=y=2;

    scanf("%s",answer);
    if(answer[0]=='M') Enemy[x][y]=-1;
    if(answer[0]=='H') Enemy[x][y]=1,lx=x,ly=y,Total_en--;
    if(answer[0]=='S')
    {
        scanf("%s",answer);
        Enemy[x][y]=1,lx=ly=0;
    }

    while(1)
    {
        //Computer's move
        scanf("%d%d",&x,&y);
        if(Me[x][y]) Total_me--;
        if(!Total_me)
        {
            printf("WINNER 1");
            fflush(stdout);
            return 0;
        }

        if(lx && ly)
        {
            for(i=1; i<=lx; i++)
                if(Enemy[i][ly]==0)
                {
                    x=i;
                    y=ly;
                    printf("%d %d\n",x,y);
                    fflush(stdout);
                    scanf("%s",answer);
                    if(answer[0]=='M') Enemy[x][y]=-1;
                    if(answer[0]=='H') Enemy[x][y]=1,lx=x,ly=y,Total_en--;
                    if(answer[0]=='S')
                    {
                        scanf("%s",answer);
                        Enemy[x][y]=1,lx=ly=0;
                    }
                    break;
                }
            if(y==lx+1)
                for(i=1; i<=ly; i++)
                    if(Enemy[lx][i]==0)
                    {
                        x=lx;
                        y=i;
                        printf("%d %d\n",x,y);
                        fflush(stdout);
                        scanf("%s",answer);
                        if(answer[0]=='M') Enemy[x][y]=-1;
                        if(answer[0]=='H') Enemy[x][y]=1,lx=x,ly=y,Total_en--;
                        if(answer[0]=='S')
                        {
                            scanf("%s",answer);
                            Enemy[x][y]=1,lx=ly=0;
                        }
                        break;
                    }
        }
        else
        {
            do
            {
                x=rand()%10+1;
                y=rand()%10+1;
            }
            while(Enemy[x][y]!=0);
            printf("%d %d\n",x,y);
            fflush(stdout);
            scanf("%s",answer);
            if(answer[0]=='M') Enemy[x][y]=-1;
            if(answer[0]=='H') Enemy[x][y]=1,lx=x,ly=y,Total_en--;
            if(answer[0]=='S')
            {
                scanf("%s",answer);
                Enemy[x][y]=1,lx=ly=0;
            }
        }
        if(!Total_en)
        {
            printf("WINNER 0\n");
            fflush(stdout);
            return 0;
        }
    }

    return 0;
}