1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
// Author: Bartek Knapik

#include <cstdio>

const int MAXN = 5000+9;

char input[MAXN];
char ans[MAXN];

inline void send(const char* s)
{
    printf("%s", s);
    fflush(stdout);
}

void run(int n)
{
    int score, pos_me, pos_op;
    char c[2];
    
    score = pos_me = pos_op = 0;
    scanf("%s", input);
    
    while (pos_me < n && pos_op < n)
    {
        if (score == 0)
        {
            if (input[pos_me] == '0')
                send("P");
            else
                send("K");
            scanf("%s", c);
            if (c[0] == 'P')
                ans[pos_op] = '0';
            else if (c[0] == 'K')
                ans[pos_op] = '1';
            
            if (input[pos_me] == '0' && c[0] == 'K')
                score++;
            else if (input[pos_me] == '1' && c[0] == 'P')
                score--;
            pos_me++;
            pos_op++;
        }
        else if (score == -1)
        {
            if (input[pos_me] == '0')
            {
                send("P");
                score++;
            }
            else
                send("K");
            scanf("%s", c);
            pos_me++;
        }
        else if (score == 1)
        {
            send("K");
            scanf("%s", c);
            if (c[0] == 'P')
            {
                ans[pos_op] = '0';
                score--;
            }
            else if (c[0] == 'K')
                ans[pos_op] = '1';
            pos_op++;
        }
    }
    
    while (pos_me < n)
    {
        if (input[pos_me] == '0')
            send("P");
        else
            send("K");
        scanf("%s", c);
        if (input[pos_me] == '0' && c[0] == 'K')
            score++;
        else if (input[pos_me] == '1' && c[0] == 'P')
            score--;
        pos_me++;
    }
    
    while (pos_op < n)
    {
        if (score == -1)
        {
            send("P");
            scanf("%s", c);
            if (c[0] == 'K')
                score = 0;
        }
        else
        {
            send("K");
            scanf("%s", c);
            if (c[0] == 'P')
                score--;
        }
        if (c[0] == 'P')
            ans[pos_op] = '0';
        else
            ans[pos_op] = '1';
        pos_op++;
    }
    
    ans[n] = 0;
    printf("! %s\n", ans);
    fflush(stdout);
}

int main()
{
    int n, T;
    
    scanf("%s", input);
    scanf("%d%d", &n, &T);
    
    for (int t = 0; t < T; ++t)
        run(n);
    fflush(stdout);
    return 0;
}