#include<cstdio> |
#include<cstdlib> |
#include<iostream> |
#include<cmath> |
#include<cctype> |
#include<algorithm> |
#include<cstring> |
using namespace std; |
#define MAXN 1000000+10 |
int pos[MAXN]; |
int main() |
{ |
int T; |
scanf ( "%d" ,&T); |
while (T--) |
{ |
int L,n; |
scanf ( "%d%d" ,&L,&n); |
int i,pos; |
int minn=( int )L/2,maxx=0,posmin; |
for (i=0;i<n;i++) |
{ |
scanf ( "%d" ,&pos); |
//if(pos==0) continue; |
if (max(pos,L-pos)>maxx) |
{ |
maxx=max(pos,L-pos); |
// maxx=pos; |
} |
if ( abs (pos-L/2)<minn) |
{ |
minn= abs (pos-L/2); |
posmin=pos; |
// deltamin=abs(pos-minn); |
} |
// cout<<minn<<endl; |
} |
// cout<<"****"<<minn<<endl; |
minn=min(posmin,L-posmin); |
printf ( "%d %d\n" ,minn,maxx); |
} |
return 0; |
} |