#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int INF=0x3f,maxn=101,maxb=1001;
int T,n,b,s[maxn],c[maxn],dp[maxn][maxb],sum[maxn][maxb];
int main()
{
    int Case=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&b,&n);
        for(int i=n;i>=1;--i)scanf("%d%d",&s[i],&c[i]);
        memset(dp,0,sizeof(dp));
        /*for(int i=1;i<=n;++i)
            for(int j=1;j<=b;++j)
                sum[i][j]=INF;*/
        memset(sum,INF,sizeof(sum));
        for(int i=0;i<=n;++i)sum[i][0]=0;
        for(int i=0;i<=b;++i)sum[0][i]=0;
        for (int i = 1; i <= n; ++i) {
            for (int j = b; j >= 0; --j) {
                if(c[i]==0&&s[i]>0){dp[i][j]=dp[i-1][j]+s[i];sum[i][j]=sum[i-1][j]+(n+1-i);continue;}
                if(c[i]==0&&s[i]==0){dp[i][j]=dp[i-1][j];sum[i][j]=sum[i-1][j];continue;}
                if(j<c[i]){dp[i][j]=dp[i-1][j];sum[i][j]=sum[i-1][j];}
                else
                {
                    int buy = dp[i-1][j-c[i]]+s[i],not_buy = dp[i-1][j];
                    int buy_sum = sum[i-1][j-c[i]]+(n+1-i),not_buy_sum = sum[i-1][j];
                    if(buy<not_buy){dp[i][j]=not_buy;sum[i][j]=not_buy_sum;}
                    else if(buy>not_buy){dp[i][j]=buy;sum[i][j]=buy_sum;}
                    else
                    {
                        if(buy_sum<not_buy_sum){dp[i][j]=buy;sum[i][j]=buy_sum;}
                        else{dp[i][j]=not_buy;sum[i][j]=not_buy_sum;}
                    }
                }
            }
        }
        printf("Case #%d:\n",Case++);
        if(dp[n][b]==0)printf("0 0\n");
        else
        {
            int cost=0,bb=b;
            vector<int>ans;
            for(int i=n;i>=1;--i)
                if(dp[i][bb]==dp[i-1][bb-c[i]]+s[i]&&sum[i][bb]==sum[i-1][bb-c[i]]+(n+1-i))
                    ans.push_back(n+1-i),cost+=c[i],bb-=c[i];
            printf("%d %d\n",dp[n][b],cost);
            for(int i=0;i<ans.size();++i)printf("%d%c",ans[i],i==ans.size()-1?'\n':' ');
        }
    }
    return 0;
}