#include<iostream>
#include<queue>
#include<utility>
#include<vector> 
using namespace std;
#define ll long long
#define PII pair<ll, int>
const int N = 1e5 + 10, M = N * 35;

int x, y;
int e[M], ne[M], h[N], idx, times[N], cnt = 1;
ll dist[N], w[M], ww;
bool vis[N];

void add(int a, int b, ll ww)
{
	e[idx] = b, ne[idx] = h[a], w[idx] = ww, h[a] = idx ++;
}
void dij()
{
	priority_queue<PII, vector<PII>, greater<PII>> heap;
	heap.push({0, x});
	dist[x] = 0;
	times[x] = 0;
	while (heap.size())
	{
		auto t = heap.top();
		heap.pop();
		int ver = t.second;
		if (vis[ver])	continue;
		vis[ver] = 1;
		for (int i = h[ver]; i != -1; i = ne[i])
		{
			int j = e[i];
			if (dist[j] == dist[ver] + w[i])
				times[j] = min(times[ver] + 1, times[j]);
			else if (dist[j] > dist[ver] + w[i])
			{
				dist[j] = dist[ver] + w[i];
				heap.push({dist[j], j}); 
				times[j] = times[ver] + 1;
			}
		}
	}
}
void solve()
{
	idx = 0;
	for (int i = 0; i <= y; i ++)	
	{
		h[i] = -1;
		vis[i] = 0;
		dist[i] = 1e15;
		times[i] = 2e5; 
	}
	cout << "Case " << cnt ++ << ": ";
	cin >> ww;
	for (int j = 1; j * 10 <= y; j ++)
		add(j, j * 10, ww);
	for (int i = 1; i < 10; i ++)
	{
		cin >> ww;
		for (int j = 0; j * 10 + i <= y; j ++)
			add(j, j * 10 + i, ww);
	}
	cin >> ww;
	for (int i = 1; i < 10; i ++)
	{
		cin >> ww;
		for (int j = 0; j + i <= y; j ++)
			add(j, j + i, ww);
	}
	cin >> ww;
	for (int j = 0; j < y; j ++)
		add(j, 0, ww);
	cin >> ww;
	for (int i = 2; i < 10; i ++)
	{
		cin >> ww;
		for (int j = 0; j * i <= y; j ++)
			add(j, j * i, ww);
	}
	dij();
	cout << dist[y] << ' ' << times[y] << '\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	while (cin >> x >> y)
		solve();
	return 0;
 }