#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
const int S = 200;
int n, j, k, l, r;
char s[S], u[S], t[S];
int main() {
    freopen("abbreviation.in", "r", stdin);
    freopen("abbreviation.out", "w", stdout);
    scanf("%d\n", &n);
    for(int i=0; i<n; i++) {
        memset(t, 0, sizeof(t));
        memset(s, 0, sizeof(s));
        memset(u, 0, sizeof(u));
        fgets(s, S, stdin);
        l = strlen(s);
        for(int v=0; v<l; v++) s[v] = tolower(s[v]);
        s[l] = ' ';
        r = j = 0;
        while(sscanf(s+j, "%s ", u) == 1) {
            k = strlen(u);
            if((k > 3) || (k == 3 && strcmp(u, "and") &&
                        strcmp(u, "for") && strcmp(u, "the")))
                    t[r++] = toupper(u[0]);
            j += k+1;
        }
        printf("%s\n", t);
    }
    return 0;
}