#include<bits/stdc++.h>
using namespace std;
char tmp1[4];
int l,r,n,m;
string s;
int cnt[50005][4];
struct node {
    int num; int id;
}tmp[4];
bool cmp(const node & x, const node & y){
    return x.num > y.num || ((x.num == y.num) && (x.id < y.id));
}
int main(){
    cin>>s>>m; n = s.size(); s = " " + s;
    tmp1[0] = 'A'; tmp1[1] = 'T', tmp1[2] = 'G'; tmp1[3] = 'C';
    for(int i=1;i<=n;i++) cnt[i][0] = cnt[i-1][0] + (s[i] == 'A'), cnt[i][1] = cnt[i-1][1] + (s[i] == 'G'), cnt[i][2] = cnt[i-1][2] + (s[i] == 'C'), cnt[i][3] = cnt[i-1][3] + (s[i] == 'T');
    while(m--){
        cin>>l>>r;
        tmp[0] = (node){cnt[r][0] - cnt[l-1][0], 0};
        tmp[1] = (node){cnt[r][1] - cnt[l-1][1], 2};
        tmp[2] = (node){cnt[r][2] - cnt[l-1][2], 3};
        tmp[3] = (node){cnt[r][3] - cnt[l-1][3], 1};
        sort(tmp, tmp+4, cmp);
        for(int i=0;i<4;i++) cout<<tmp1[tmp[i].id];
        cout<<endl;
    }
    return 0;
}