/*
TASK: moves
LANG: C++
*/
//Rumen Hristov Hristov
#include <stdio.h>

int dx[] = { -1 , -1 , 1 , 1 };
int dy[] = { -1 , 1 , -1 , 1 };

int n,m;

void solve()
{
    int x,y,x2,y2;
    int u,v,u2,v2;
    int k;
    
    printf ("a\n");
    
    scanf ("%d%d",&x,&y);
    scanf ("%d%d",&x2,&y2);
    
    for (k=0;k<4;k++)
    {
        u = x + dx[k];
        v = y + dy[k];
        
        if ( u == x2 && v == y2 )
        {
            printf ("0");
            return ;
        }
    }
    
    printf ("1");
}

int main()
{
    int k;
    int i;
    
    scanf ("%d%d",&n,&m);
    
    for (i=0;i<k;i++)
    {
        solve();
    }
    
    printf ("\n");
    return 0;
}
