#include<bits/stdc++.h>
using namespace std;
#define in inline
#define ll long long
#define ep emplace_back
const int K=32,N=1e3+10;
in int read()
{
    int w=0,r=1;
    char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')r=-1;ch=getchar();}
    while(isdigit(ch)){w=(w<<1)+(w<<3)+(ch^48);ch=getchar();}
    return w*r;
}

int T=100;
string opt;
bool pd[32][1010],vl[32];
char s[1010],a[3010],b[3010];
mt19937 rng(19491001);
void solve1()
{
    while(T--)
    {
        scanf("%s",(s+1));
        for(int i=1;i<=30;i++)
        {
            int x=0;
            for(int j=1;j<=1000;j++)x^=(s[j]-'0')&pd[i][j];
            printf("%c",(char)(x+'0'));
        }
        puts("");
    }
}
void solve2()
{
    scanf("%s%s",(a+1),(b+1));
    while(T--)
    {
        scanf("%s",(s+1));
        for(int i=1;i<=30;i++)
        {
            vl[i]=0;
            for(int j=1;j<=1000;j++)vl[i]^=(s[j]-'0')&pd[i][j];
        }
        bool mrk=0;
        for(int i=1;i<=100;i++)
        {
            for(int j=1;j<=100;j++)
            {
                bool flg=1;
                for(int k=1;k<=30;k++)if((a[(i-1)*30+k]^b[(j-1)*30+k])!=vl[k])flg=0;
                if(flg)
                {
                    printf("%d %d\n",i,j);
                    mrk=1;
                    break;
                }
            }
            if(mrk)break;
        }
    }
}
int main()
{
    // freopen("1.in","r",stdin);
    // freopen(".out","w",stdout);
    cin>>opt;
    for(int i=1;i<=30;i++)for(int j=1;j<=1000;j++)pd[i][j]=rng()&1;
    if(opt=="Alice"||opt=="Bob")solve1();
    else solve2();
    return 0;
}