// Di chuyen bo - Thaopt

#include <iostream>
using namespace std;

int TC, M, N, m[20];
int maxx;

void backtrack( int k, int sum){
	if(k>N) return;
	else{
		if(sum>maxx && sum<=M){
			maxx=sum;
		}
			backtrack(k+1, sum+m[k]);
			backtrack(k+1, sum);
		}
	}
	 
int main(){
	//freopen("in.txt", "r", stdin);
	cin>> TC;
	for(int t=1; t<=TC; t++){
		cin>>M;
		cin>>N;
		for(int i=0; i<N; i++){
			cin>> m[i];
		}
		maxx=0;
		
		backtrack(0,0);
		cout<<"#"<< t<<" "<< maxx<< endl;
	}
	return 0;
}