#include<bits/stdc++.h>
#define lowbit(x) (x&(-x))
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define pre(x,a,b) for(int x=a;x>=b;x--)
#define endl "\n"
#define pb push_back
#define ll long long
#define int long long
#define pii pair<ll,ll>
#define psi pair<string, ll>
#define de cout<<1;
#define mem(a,x) memset(a,x,sizeof a)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int mod1=998244353;
const int mod2=1e9+7;
const int INF=1e18;
const int N = 1e6 + 60;
int number;
int n, m,idd;
int mp[5][15];
ll dis[N],book[N];
struct node
{
    ll num;
    ll w;
    ll step;
    bool operator< (const node &a)const
    {
        if(w==a.w)return a.step<step;
        return a.w<w;
    }
};

void bfs()
{
    priority_queue<node>q;
    q.push({n,0,0});
    rep(i,0,m)book[i]=0,dis[i]=INF;
    dis[n]=0;
    while(!q.empty())
    {
        node A=q.top();
        q.pop();
        //cout << A.num<<endl;
        if(book[A.num])continue;
        book[A.num]=1;
        if(A.num==m)
        {
            cout <<"Case "<<idd<<": "<<A.w <<' '<<A.step<<endl;
            return;
        }
        rep(i,1,3)
        {
            rep(j,0,9)
            {
                int ww=A.w+mp[i][j];
                int nnum;
                if(i==1)
                {
                    nnum=A.num*10+j;
                }else if(i==2)
                {
                    nnum=A.num+j;
                }else
                {
                    nnum=A.num*j;
                }
                //cout << nnum <<endl;
                if(nnum<=m && !book[nnum] && dis[nnum]>ww)
                {
                    //cout << nnum<<endl;
                    dis[nnum]=ww;
                    q.push({nnum,ww,A.step+1});
                }
            }
        }
    }
}



void solve()
{
    while(cin >> n >> m)
    {
        idd++;
        rep(i,1,3)
        {
            rep(j,0,9)
            {
                cin >> mp[i][j];
            }
        }
        bfs();
    }
}
signed main()
{
	IOS;
	int _;
	//scanf("%d", &_);
	_ = 1;
	while(_ -- )
	{
		number++;
		solve();
	}
	return 0;
}