题解 | #查找兄弟单词#

def bro_words(words,x):
    res = []
    for word in words:
        if len(word) == len(x) and word != x:
            if sorted(word) == sorted(x):
                res.append(word)
    return res
try:
    while True:
        lst = input().split()
        n = int(lst[0])
        words = lst[1:n+1]
        x = lst[-2]
        k = int(lst[-1])
        bros = sorted(bro_words(words, x))
        print(len(bros))
        if k<=len(bros):
            print(bros[k-1])
except:
    pass