Felix021

//G - Pinhole Image
#include<stdio.h>
#include<math.h>

int main(){
    int n, A, B, H;
    scanf("%d", &n);
    while (n--){
        scanf("%d%d%d", &A, &B, &H);
        printf("%.2lf\n",(double)B * (double)H / (double)A);
    }
    return 0;
}

//H - URL
#include<iostream>
#include<cstring>
#include<map>
#include<set>
using namespace std;

struct ooxx{
    string t;
    int c;
    friend inline bool operator <(const ooxx &a, const ooxx &b){
        return ((a.c > b.c) ||
                (a.c == b.c && a.t < b.t));
    }
};

char act[20], url[110];
map<string, int>st;
map<string, int>::iterator p, q;
set<ooxx> jiong;
set<ooxx>::iterator jp;

void visit();
void display();

int main(){
    int T, N;
    scanf("%d", &T);
    while(T--){
        st.clear();
        scanf("%d", &N);
        for (int i = 0; i < N; ++i){
            scanf("%s%s", act, url);
            if(act[0] == 'V') visit();
            else display();
        }
    }
    return 0;
}

void visit(){
    string t = string(url);
    st[t]++;
}

void display(){
    jiong.clear();
    int len = strlen(url), i;
    for(p = st.begin(), q = st.end(); p != q; p++){
        for(i = 0; i < len; ++i){
            if(p->first[i] != url[i]) break;
        }
        if(i == len){
            ooxx a;
            a.t = p->first;
            a.c = p->second;
            jiong.insert(a);
        }
    }
    for(jp = jiong.begin(); jp != jiong.end(); jp++){
        printf("%s\n", (jp->t).c_str());
    }
    printf("\n");
}