#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

void solve() {
    string S; cin >> S;
    int N; cin >> N;
    vector<vi> v(S.length() + 1, vi(4, 0));
    for(int i = 0; i < (int) S.length(); i++) {
        v[i + 1][0] = v[i][0] + (S[i] == 'A');
        v[i + 1][1] = v[i][1] + (S[i] == 'T');
        v[i + 1][2] = v[i][2] + (S[i] == 'G');
        v[i + 1][3] = v[i][3] + (S[i] == 'C');
    }
    for(int i = 0; i < N; i++) {
        int a, b; cin >> a >> b; a--;
        vector<pair<int, int>> ord;
        ord.emplace_back(v[b][0] - v[a][0], 3);
        ord.emplace_back(v[b][1] - v[a][1], 2);
        ord.emplace_back(v[b][2] - v[a][2], 1);
        ord.emplace_back(v[b][3] - v[a][3], 0);
        sort(ord.begin(), ord.end(), greater<pair<int, int>>());
        for(auto[x, y] : ord) {
            if(y == 0) cout << 'C';
            if(y == 1) cout << 'G';
            if(y == 2) cout << 'T';
            if(y == 3) cout << 'A';
        }
        cout << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}