题解 | #查找兄弟单词#

def solution(inp):
    n = int(inp[0])
    dic = inp[1 : n + 1]
    x = inp[-2]
    k = int(inp[-1])
    bro = []
    for item in dic:
        if item == x:
            continue
        if sorted(x) == sorted(item):
            bro.append(item)
    bro.sort()
    num = len(bro)
    print(num)
    try:
        brother = bro[k - 1]
        print(brother)
    except:
        pass


if __name__ == "__main__":
    inp_lst = input().split()
    solution(inp_lst)