#include <bits/stdc++.h>
using namespace std;
const int mx1 = 15;
const int mx2 = 505;
const int mx3 = 1005;
const int mx4 = 10005;
const int mx5 = 100005;
const int mx6 = 1000005;
int _toggle(int N, int pos) { return N = N ^ (1 << pos); }
int _set(int N, int pos) { return N = N | (1 << pos); }
int _reset(int N, int pos) { return N = N & ~(1 << pos); }
bool _check(int N, int pos) { return (bool)(N & (1 << pos)); }
bool _upper(char a) { return a >= 'A' && a <= 'Z'; }
bool _lower(char a) { return a >= 'a' && a <= 'z'; }
bool _digit(char a) { return a >= '0' && a <= '9'; }
int dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int n, q, a, mx, ans[mx5][2];
deque<int> Q;
void solve() {
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a;
    mx = max(a, mx);
    Q.push_back(a);
  }
  if (q == 0) {
    cout << '\n';
    return;
  }
  vector<int> stt;
  int pre, f = 0;
  for (int i = 1; i <= n; i++) {
    int A = Q.front();
    Q.pop_front();
    int B = Q.front();
    Q.pop_front();
    if (A == mx && !f) {
      f = 1;
      pre = i - 1;
      stt.push_back(B);
      while (!Q.empty()) {
        stt.push_back(Q.front());
        Q.pop_front();
      }
      break;
    }
    if (A > B) {
      Q.push_front(A);
      Q.push_back(B);
    } else {
      Q.push_front(B);
      Q.push_back(A);
    }
    ans[i][0] = A, ans[i][1] = B;
  }
  while (q--) {
    long long x;
    cin >> x;
    if (x <= pre) {
      cout << ans[x][0] << ' ' << ans[x][1] << '\n';
    } else {
      x -= pre;
      x %= (n - 1);
      if (!x) {
        x = n - 1;
      }
      x--;
      cout << mx << ' ' << stt[x] << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tc = 1;
  while (tc--) {
    solve();
  }
}
