#include <iostream> 
#include <algorithm> 
#include <cstring> 
#include <cstdio>
#include <vector> 
#include <queue> 
#include <cstdlib> 
#include <iomanip>
#include <cmath> 
#include <ctime> 
#include <map> 
#include <set> 
using namespace std; 
#define lowbit(x) (x&(-x)) 
#define max(x,y) (x>y?x:y) 
#define min(x,y) (x<y?x:y) 
#define MAX 100000000000000000 
#define MOD 1000000007
#define pi acos(-1.0) 
#define ei exp(1) 
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 0x3f3f3f3f 
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
int dp[1005],ans,t;
int path[105][1005];
int vis[1005][105];
struct Node
{
    int score;
    int cost;
}node[105];
int N,n,cast;
int top,mark;
int main()
{
    scanf("%d",&t);
    cast=0;
    while(t--)
    {
        scanf("%d%d",&N,&n);
        ans=0;
        int pos=INF,cnt,sum,inf=0;
        memset(dp,0,sizeof(dp));
        memset(path,0,sizeof(path));
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&node[i].score,&node[i].cost);
        }
        printf("Case #%d:\n", ++cast);
        for(int i=1;i<=n;i++)
        {
            for(int j=N;j>=node[i].cost;j--)
            {
                if(dp[j]<dp[j-node[i].cost]+node[i].score)
                {
                    dp[j]=dp[j-node[i].cost]+node[i].score;
                    path[i][j]=1;
                }
            }
        }
        for(int i=0;i<=N;i++)
        {
            ans=max(dp[i],ans);
        }
        top=1;mark=1;
        for(int k=N;k>=0;k--)
        {
            if(dp[k]==ans)
            {
                cnt=0;sum=0;
                for(int i=n,j=k;i>=1 && j>=0;i--)
                {
                    if(path[i][j])
                    {
                        vis[top][++cnt]=i;
                        sum+=i;
                        j-=node[i].cost;
                    }
                }
                vis[top][0]=cnt;
                sort(vis[top]+1,vis[top]+1+cnt);
                if(pos>sum)
                {
                    pos=sum;
                    mark=top;
                }
                else if(pos==sum)
                {
                    for(int s=1;s<=vis[top][0] && s<=vis[mark][0];s++)
                    {
                        if(vis[mark][s]==vis[top][s]) continue;
                        else if(vis[mark][s]<vis[top][s]) break;
                        else {mark=top;break;}
                    }
                }
                top++;
            }
        }
        for(int i=1;i<=vis[mark][0];i++)
            inf+=node[vis[mark][i]].cost;
        printf("%d %d\n",ans,inf);
        if(vis[mark][0]==0) continue;
        else
        {
            for(int i=1;i<=vis[mark][0];i++)
            {
                if(i!=1) printf(" ");
                printf("%d",vis[mark][i]);
            }
            printf("\n");
        }
    }
    return 0;
}