N3_80_from_100

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    queue <int> q;
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int x; cin >> x;
        q.push(x);
    }
    int a = q.front(), b;
    q.pop();
    int t, mx = -1;
    cin >> t;
    vector <int> req(t);
    for (int &i: req) {
        cin >> i;
        mx = max(i, mx);
    }

    vector <pii> ans(mx + 1);
    for (int i = 1; i <= mx; ++i) {
        b = q.front();
        q.pop();
        ans[i] = {a, b};
        if (a < b) {
            swap(a, b);
        }
        q.push(b);

    }
    for (int i: req) {
        cout << ans[i].first << ' ' << ans[i].second << "\n";
    }
}