12345678910111213141516171819202122232425262728293031323334353637383940jiapu=dict()
fathers=list()
nowf=""
def findf(string):
    global jiapu
    if jiapu[string]==string:
        return string
    else:
        jiapu[string]=findf(string)
        return jiapu[string]
while True:
    s=input()
    if s[0] == "#":
        if fathers.count(s[1:]) ==0:
            jiapu[s[1:]]=s[1:]
            fathers.append(s[1:])
            nowf=s[1:]
        else:
            nowf=findf(s[1:])
    elif s[0] == "+":
        jiapu[s[1:]]=nowf
        jiapu[findf(s[1:])]=nowf
    elif s[0] == "?":
        print(s[1:],findf(s[1:]))
    else:
        break
#报错信息
#Traceback (most recent call last):
#  File "C:/ProgramFiles/Python38/jp.py", line 22, in <module>
#    jiapu[findf(s[1:])]=nowf
#  File "C:/ProgramFiles/Python38/jp.py", line 9, in findf
#    jiapu[string]=findf(string)
#  File "C:/ProgramFiles/Python38/jp.py", line 9, in findf
#    jiapu[string]=findf(string)
#  File "C:/ProgramFiles/Python38/jp.py", line 9, in findf
#    jiapu[string]=findf(string)
#  [Previous line repeated 1021 more times]
#  File "C:/ProgramFiles/Python38/jp.py", line 6, in findf
#    if jiapu[string]==string:
#RecursionError: maximum recursion depth exceeded in comparison