#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x: v) out << x << ' ';
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif
}

void Solve(){
    string s;
    int sz, x;
    cin >> s >> sz >> x;
    map < char, int > occ;
    vector < char > chars;
    for(char c = 'A'; c <= 'Z'; c++) occ[c] = 0, chars.push_back(c);
    for(char c = 'a'; c <= 'z'; c++) occ[c] = 0, chars.push_back(c);
    for(auto& c : s) occ[c]++;
    int max_score = 0;
    string best_answer;
    for(int i = 0; i < sz(chars); i++){
        int score = 0, j = i;
        if(occ[chars[i]] == 0) continue;
        while(score < x && j < sz(chars)){
            if(occ[chars[j]] == 0){
                j++;
                continue;
            }
            score = j - i;
            int idx = i;
            string ans;
            while(idx < j){
                ans += string(min(occ[chars[idx]], sz - sz(ans)), chars[idx]);
                idx++;
            }
            if(sz(ans) == sz) ans.pop_back();
            for(int ii = 0; ii < occ[chars[j]] && sz(ans) < sz; ii++) ans += chars[j];
            cout << score << ' ' << ans << '\n';
            if(max_score < score && sz(ans) == sz && score < x)
                max_score = score, best_answer = ans;
            else if (max_score == score && sz(ans) == sz && score < x)
                max_score = score, best_answer = min(best_answer, ans);
            j++;
        }
    }
    if(best_answer.empty()) cout << "Ammit wins\n";
    else cout << "Taweret wins : " << best_answer << '\n';
}

int main(){
    AhMeD_HoSSaM();
    int t = 1;
    cin >> t;
    while(t--)
        Solve();
    return 0;
}