UVa 10714 - Ants

// UVa 10714 - Ants
// Coded by arpo and danile53
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAXN = 1000000;

int a[MAXN];

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int l, n;
		scanf("%d %d", &l, &n);

		int minX = MAXN + 1, maxX = -1;

		for (int i = 0; i < n; i++) {
			scanf("%d", &a[i]);
			minX = min(minX, a[i]);
			maxX = max(maxX, a[i]);
		}

		int solMin = -1;
		for (int i = 0; i < n; i++)
			solMin = max(solMin, min(a[i], l - a[i]));

		int solMax = max(minX, l - minX);
		solMax = max(solMax, max(maxX, l - maxX));

		printf("%d %d\n", solMin, solMax);
	}
	return 0;
}