#include <bits/stdc++.h>
using namespace std;

const int MAXN = 26;

struct Ballot {
    int cnt;
    int ord[MAXN];

    Ballot(int cnt, string& s) {
        this->cnt = cnt;
        for (int i = 0; i < s.size(); ++i) {
            ord[s[i]-'A'] = i;
        }
    }

    bool beat(int i, int j) { return ord[i] < ord[j]; }
};

vector<int> adj[MAXN];
bitset<MAXN> vis;


void dfs(int c) {
    if (vis[c]) return;
    vis[c] = 1;
    for (int t : adj[c]) {
        dfs(t);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int N, M; cin >> N >> M;
    vector<Ballot> ballots;
    for (int i = 0; i < M; ++i) {
        int cnt; string s;
        cin >> cnt >> s;
        ballots.push_back(Ballot(cnt,s));
    }
    for (int i = 0; i < N; ++i) {
        for (int j = i+1; j < N; ++j) {
            int cnti = 0;
            int cntj = 0;
            for (Ballot& b : ballots) {
                if (b.beat(i, j)) {
                    cnti += b.cnt;
                } else {
                    cntj += b.cnt;
                }
            }
            if (cnti > cntj) adj[i].push_back(j);
            else adj[j].push_back(i);
        }
    }
    
    for (int i = 0; i < N; ++i) {
        vis.reset();
        dfs(i);
        bool good = 1;
        for (int j = 0; j < N; ++j) {
            if (!vis[j]) good = 0;
        }
        char c = 'A'+i;
        string ans = good ? "can win" : "can't win";
        cout << c << ": " << ans << '\n';
    }
}

/*

5 5
4 ADCBE
3 DCABE
3 CADBE
2 BDCAE
1 EBCDA


3 3
1 ABC
1 BCA
1 CAB

*/