#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cctype>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(c,i) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	for(int loop=1,weight_max;cin>>weight_max,weight_max;loop++){
		int n;
		cin>>n;
		vi value(n),weight(n);
		rep(i,n)
			scanf("%d,%d",&value[i],&weight[i]);
		
		vi dp(weight_max+1);
		rep(i,n){
			vi dp2=dp;
			repi(j,weight[i],dp.size())
				dp2[j]=max(dp[j],dp[j-weight[i]]+value[i]);
			dp=dp2;
		}
		
		int res_value=0;
		int res_weight=0;
		rep(i,dp.size()){
			if(dp[i]>res_value){
				res_value=dp[i];
				res_weight=i;
			}
		}
		cout<<"Case "<<loop<<":"<<endl;
		cout<<res_value<<endl;
		cout<<res_weight<<endl;
	}
	
	return 0;
}