#include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

template<typename T>
bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}

int main(){
	//cin.tie(0);
	//ios::sync_with_stdio(false);

	int C=1;
	while(true){
		int W=in();
		if(!W) break;
		int N=in();
		vector<int> v(N),w(N);
		REP(i,N){
			scanf("%d,%d",&v[i],&w[i]);
		}

		vector<vector<int>> dp(N+1,vector<int>(W+1,0));

		REP(i,N){
			REP(j,W+1){
				if(j+w[i]<=W) chmax(dp[i+1][j+w[i]],dp[i][j]+v[i]);
				chmax(dp[i+1][j],dp[i][j]);
			}
		}
		int AW=0,AV=0;
		REP(i,W+1){
			if(dp[N][i]>AV){
				AV = dp[N][i];
				AW = i;
			}
		}
		printf("Case %d:\n",C++);
		out(AV);
		out(AW);
	}
	return 0;
}
