Problem Statement

In the headquarter building of ICPC (International Company of Plugs & Connectors), there are $M$ light bulbs and they are controlled by $N$ switches. Each light bulb can be turned on or off by exactly one switch. Each switch may control multiple light bulbs. When you operate a switch, all the light bulbs controlled by the switch change their states. You lost the table that recorded the correspondence between the switches and the light bulbs, and want to restore it.

You decided to restore the correspondence by the following procedure.

* At first, every switch is off and every light bulb is off.
* You operate some switches represented by $S_1$.
* You check the states of the light bulbs represented by $B_1$.
* You operate some switches represented by $S_2$.
* You check the states of the light bulbs represented by $B_2$.
* ...
* You operate some switches represented by $S_Q$.
* You check the states of the light bulbs represented by $B_Q$.



After you operate some switches and check the states of the light bulbs, the states of the switches and the light bulbs are kept for next operations.

Can you restore the correspondence between the switches and the light bulbs using the information about the switches you have operated and the states of the light bulbs you have checked?

Input

The input consists of multiple datasets. The number of dataset is no more than $50$ and the file size is no more than $10\mathrm{MB}$. Each dataset is formatted as follows.

> $N$ $M$ $Q$
> $S_1$ $B_1$
> :
> :
> $S_Q$ $B_Q$

The first line of each dataset contains three integers $N$ ($1 \le N \le 36$), $M$ ($1 \le M \le 1{,}000$), $Q$ ($0 \le Q \le 1{,}000$), which denote the number of switches, the number of light bulbs and the number of operations respectively. The following $Q$ lines describe the information about the switches you have operated and the states of the light bulbs you have checked. The $i$-th of them contains two strings $S_i$ and $B_i$ of lengths $N$ and $M$ respectively. Each $S_i$ denotes the set of the switches you have operated: $S_{ij}$ is either $0$ or $1$, which denotes the $j$-th switch is not operated or operated respectively. Each $B_i$ denotes the states of the light bulbs: $B_{ij}$ is either $0$ or $1$, which denotes the $j$-th light bulb is off or on respectively.

You can assume that there exists a correspondence between the switches and the light bulbs which is consistent with the given information.

The end of input is indicated by a line containing three zeros.

Output

For each dataset, output the correspondence between the switches and the light bulbs consisting of $M$ numbers written in base-$36$. In the base-$36$ system for this problem, the values $0$-$9$ and $10$-$35$ are represented by the characters '0'-'9' and 'A'-'Z' respectively. The $i$-th character of the correspondence means the number of the switch controlling the $i$-th light bulb. If you cannot determine which switch controls the $i$-th light bulb, output '?' as the $i$-th character instead of the number of a switch.

Sample Input


3 10 3
000 0000000000
110 0000001111
101 1111111100
2 2 0
1 1 0
2 1 1
01 1
11 11 10
10000000000 10000000000
11000000000 01000000000
01100000000 00100000000
00110000000 00010000000
00011000000 00001000000
00001100000 00000100000
00000110000 00000010000
00000011000 00000001000
00000001100 00000000100
00000000110 00000000010
0 0 0

Output for the Sample Input


2222221100
??
0
1
0123456789A





Example

Input

3 10 3
000 0000000000
110 0000001111
101 1111111100
2 2 0
1 1 0
2 1 1
01 1
11 11 10
10000000000 10000000000
11000000000 01000000000
01100000000 00100000000
00110000000 00010000000
00011000000 00001000000
00001100000 00000100000
00000110000 00000010000
00000011000 00000001000
00000001100 00000000100
00000000110 00000000010
0 0 0


Output

2222221100
??
0
1
0123456789A
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 40, MAXM = 1005;
char s1[MAXN], s2[MAXM];
long long state[MAXM];
bool bulb[MAXM];
char ans[MAXM];
int main() {
    int n, m, q;
    while(cin >> n >> m >> q && (n || m || q)) {
        long long mask = (1LL << n) - 1;
        for(int i = 0; i < m; i ++) {
            state[i] = mask;
            bulb[i] = 0;
        }
        for(int i = 0; i < q; i ++) {
            scanf("%s %s", s1, s2);
            long long changed = 0, notchanged = 0;
            for(int j = 0; j < n; j ++) {
                changed = changed * 2 + (s1[j] == '1');
            }
            notchanged = mask ^ changed;
            for(int j = 0; j < m; j ++) {
                if(s2[j] - '0' == bulb[j]) {
                    state[j] &= notchanged;
                } else {
                    state[j] &= changed;
                }
                bulb[j] = s2[j] - '0';
            }
        }
//        for(int i = 0; i < m; i ++) {
//            cout << state[i] << endl;
//        }
        for(int i = 0; i < m; i ++) {
            int cnt = 0, res = -1;
            for(int j = 0; j < n; j ++) {
                if(state[i] >> (n - j - 1) & 1) {
                    res = j;
                    cnt ++;
                }
            }
            assert(cnt > 0);
            if(cnt == 1) {
                if(res < 10) {
                    ans[i] = res + '0';
                } else {
                    ans[i] = res - 10 + 'A';
                }
            } else {
                ans[i] = '?';
            }
        }
        ans[m] = 0;
        printf("%s\n", ans);
    }
    return 0;
}