#include <iostream>
#include <cmath>
#include <iomanip>
#include <deque>
#include <iterator>
#include <fstream>

using namespace std;

int main() {
	int n, m, dayst, dayend, d, k = 0, kmax = 0, maxn, minn;
	ifstream file("e.in");

	cin >> n;
	deque<char> nDeque;
	for (int i = 0; i < n; ++i) {
		int tmp;
		cin >> tmp;
		nDeque.push_back(tmp);
	}
	cin >> m;
	deque<char> mDeque;
	for (int i = 0; i < m; ++i) {
		int tmp;
		cin >> tmp;
		mDeque.push_back(tmp);
	}
	ofstream outf("e.out");
	for (int l = 0; l < m; ++l) {
		d = mDeque[l];
		for (int i = 0; i < n - 1; ++i) {
			maxn = nDeque[i];
			minn = nDeque[i];
			for (int j = i + 1; j < n; ++j) {
				if (maxn < nDeque[j]) {
					maxn = nDeque[j];
				}
				if (minn > nDeque[j]) {
					minn = nDeque[j];
				}
				if ((maxn - minn) <= d) {
					k = k + 1;
				}
				else {
					break;
				}
			}
			if (kmax < k) {
				kmax = k;
				dayst = i + 1;
				dayend = dayst + k;
			}
			k = 0;
		}
		outf << dayst << " " << dayend << endl;
		kmax = 0;
	}
	return 0;
}