from collections import Counter

w, h = map(int, input().split())

s = ''.join(input() for _ in range(h))
n = int(input())
ps = [input() for _ in range(n)]
cnt = Counter(s)
print(s)

hsh = {k: [0] * len(s) for k in set(s)}
for ch in set(s):
    r = 0
    for i, c in enumerate(s):
        if c == ch:
            r += 1
        hsh[ch][i] = r
        
def from_pattern(p):
    chrs = set()
    for s in p.split(','):
        if '-' in s:
            a, b = map(ord, s.split('-'))
            chrs |= set([chr(x) for x in range(a, b + 1)])
        else:
            chrs.add(s)
    return chrs

def solve(p):
    _s = from_pattern(p)
    c = Counter(_s)
    if all(k in cnt and v <= cnt[k] for k, v in c.items()):
        for i, x in enumerate()
    else:
        return None
    
for p in ps:
    _set = from_pattern(p)
    print(_set)