1.1 KB | 1155 chars
"""
[30553: Guess Who](https://www.acmicpc.net/problem/30553)
Tier: Bronze 1
Category: bruteforcing, implementation
"""
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "
if SET_RECURSION:
sys.setrecursionlimit(RECURSION_LIMIT)
inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n, m, q = mii()
l = [inp() for _ in range(n)]
ans = set([i for i in range(n)])
for _ in range(q):
a, b = isplit()
a = int(a)
nxt = set()
for i in ans:
if l[i][a - 1] == b:
nxt.add(i)
ans = nxt
if (len(ans) == 1):
p("unique")
p(ans.pop() + 1)
else:
p("ambiguous")
p(len(ans))
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()