#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s; cin >> s;
    int n = s.size();
    vector<vector<int>> sum(4, vector<int>(n+1));
    for (int i = 0; i < n; ++i) {
        if (s[i] == 'A') {
            sum[3][i+1] = 1;
        }
        else if (s[i] == 'T') {
            sum[2][i+1] = 1;
        }
        else if (s[i] == 'G') {
            sum[1][i+1] = 1;
        }
        else {
            sum[0][i+1] = 1;
        }
        for (int j = 0; j < 4; ++j) {
            sum[j][i+1] += sum[j][i];
        }
    }
    int q; cin >> q;
    while (q--) {
        int l,r; cin >> l >> r;
        vector<pair<int,int>> v;
        for (int i = 0; i < 4; ++i) {
            v.push_back({sum[i][r]-sum[i][l-1], i});
        }
        sort(v.rbegin(), v.rend());
        string res = "";
        for (int i = 0; i < 4; ++i) {
            if (v[i].second == 0) {
                res += 'C';
            }
            else if (v[i].second == 1) {
                res += 'G';
            }
            else if (v[i].second == 2) {
                res += 'T';
            }
            else {
                res += 'A';
            }
        }
        cout << res << "\n";
    }
}