题解 | #查找兄弟单词#

from pprint import PrettyPrinter
import sys
while True:
    try:
        arr = input().split()
        n = int(arr[0])
        dic_list = arr[1:n+1]
        base = arr[-2]
        k =int(arr[-1])
        #base_list = sorted(dic_list,key=str.upper)
        base1 = sorted(base,key=str.upper)
        cnt = 0
        bro_list = []
        for i in range(n):
            base_list = sorted(list(dic_list[i]),key=str.upper)
            if base != dic_list[i] and base1 == base_list:
                cnt+=1
                bro_list.append(dic_list[i])
        bro_list.sort()
        print(cnt)
        if len(bro_list)>=k:
            print(bro_list[k-1])
    except:
        break