题解 | #查找兄弟单词#

while True:
    try:
        data = input().split()

        n = int(data[0])  # 字典单词的个数

        k = int(data[len(data) - 1])  # 字典序排列的第k个单词

        x = data[len(data) - 2]  # 寻找x的兄弟单词

        words = data[1:len(data) - 2]  # 字典单词

        num = 0

        brother_words = []

        for i in range(len(words)):
            if x == words[i]:
                continue
            elif sorted(x) == sorted(words[i]):
                brother_words.append(words[i])
                num += 1

        brother_words_sort = sorted(brother_words)
        if k <= len(brother_words_sort):
            print(num, end='\n')
            print(brother_words_sort[k - 1])
        else:
            print(num)

    except:
        break