#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int MAXN = 100 + 10;
const int INF = 2147483647;
 
int mp[MAXN][MAXN], dp[MAXN][MAXN], cnt, r, c, way[MAXN][MAXN];
 
int cal(int x, int y)
{
    int &cur = way[x][y];
    if (cur != -1)
        return cur;
    if (dp[x][y] == 1)
        return cur = 1;
    cur = 0;
    for (int i = x; i <= r; i++)
        for (int j = y; j <= c; j++)
            if (mp[i][j] && dp[i][j] + mp[x][y]== dp[x][y])
                cur += cal(i, j);
    return cur;
}
 
int DFS(int x, int y)
{
    int &cur = dp[x][y];
    if (cur != -1)
        return cur;
    if (x == r && y == c)
        return cur = mp[r][c];
    cur = 0;
    if (x + 1 <= r)
        cur = max(DFS(x + 1, y) + mp[x][y], cur);
    if (y + 1 <= c)
        cur = max(DFS(x, y + 1) + mp[x][y], cur);
    return cur;
}
 
void PrintAns(int x, int y)
{
    if (dp[x][y] == 1)
        if (mp[x][y])
        {
            printf(" %d\n", (x - 1) * c + y);
            return;
        }
    printf(" %d", (x - 1) * c + y);
    for (int i = x; i <= r; i++)
        for (int j = y; j <= c; j++)
            if (mp[i][j] && dp[x][y] - 1 == dp[i][j])
            {
                PrintAns(i, j);
                return;
            }
}
 
void OutPut()
{
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++)
            if (mp[i][j] && dp[i][j] == DFS(1, 1))
            {
                PrintAns(i, j);
                return;
            }
}
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int i, j, a, b, cases = 0;
    while (scanf("%d%d", &r, &c), r + c != -2)
    {
        cnt = 0;
        memset(mp, 0, sizeof mp);
        memset(dp, -1, sizeof dp);
        memset(way, -1, sizeof way);
        while (scanf("%d%d", &a, &b), a + b)
            mp[a][b] = 1;
        int ans = DFS(1, 1);
        cal(1, 1);
        printf("CASE#%d: %d %d", ++cases, ans, way[1][1]);
        OutPut();
    }
    return 0;
}