import java.util.*;
class Combi{
    String comb;
    int count;
    public Combi(String comb, int count) {
        this.comb = comb;
        this.count = count;
    }
}
class Solution {
    static List<String> ans = new ArrayList<>();
    static List<Combi> combi[] = new List[11];
    static int popular[] = new int[11];
    static String[] orders;
    static int[] course;
    static boolean visited[] = new boolean[26];
    public String[] solution(String[] o, int[] c) {
        String[] answer = {};
        orders = o; course = c;
        for (int count : course)
            combi[count] = new ArrayList<>();
        for (String order : orders) {
            for (int i = 0; i < order.length(); i++) {
                visited[order.charAt(i) - 'A'] = true;
            }
        }
        for (int count : course) {
            getCombination(count, 0, 0, 0);
            Collections.sort(combi[count], (a, b) -> (b.count - a.count));
            int max = combi[count].get(0).count;
            String maxWord = combi[count].get(0).comb;
            if(max < 2) continue;
            ans.add(maxWord);
            for (Combi comb : combi[count]) {
                if(max == comb.count) {
                    if(maxWord.equals(comb.comb)) continue;
                    ans.add(comb.comb);
                }
                else break;
            }
        }
        Collections.sort(ans);
        answer = new String[ans.size()];
        for (int i = 0; i < ans.size(); i++) {
            answer[i] = ans.get(i);
        }
        return answer;
    }
    private void getCombination(int max, int start, int made, int cnt) {
        if(max == cnt){
            int count = 0;
            for (String order : orders) {
                int mask = makeMask(order);
                if((mask & made) == made)
                    count += 1;
            }
            String comb = findComb(made);
            combi[max].add(new Combi(comb, count));
            return;
        }
        for (int i = start; i < 26; i++) {
            if(visited[i])
                getCombination(max, i + 1, made | (1 << i), cnt + 1);
        }
    }
    private int makeMask(String word) {
        int ret = 0;
        for (int i = 0; i < word.length(); i++) {
            int pos = word.charAt(i) - 'A';
            ret |= (1 << pos);
        }
        return ret;
    }
    private String findComb(int made) {
        String ret = "";
        for (int i = 0; i < 26; i++) {
            if(((1 << i) & made) > 0)
                ret += (char)('A' + i);
        }
        return ret;
    }
}