#include"iostream"
#include"stdio.h"
#include"algorithm"
#include"cmath"
#include"string"
#include"string.h"
#include"queue"
#include"stack"
#include"vector"
#define  mx 105
using namespace std;
int  g[mx][mx];
int value[mx][mx];//存放每个点的价值
int time[mx][mx];//存放每个点的时间
int M[mx];//存放宝物的价值
int h,w,m,l,sx,sy,ex,ey,maxvalue;
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
struct node
{int x,y;int times;int  values;
};
bool judge1(int x,int y)//判断能不能走
{if(x>=0&&x<h&&y>=0&&y<w&&g[x][y]!=-1)return true;return false;
}
bool judge2(int x,int y,int v,int t)//判断应不应该走
{if(v>value[x][y]) return true;if(t<time[x][y]) return true;return false;
}
void bfs()
{queue<node>q;node cur,next;int i;cur.x=sx;cur.y=sy;cur.times=0;cur.values=0;q.push(cur);while(!q.empty()){cur=q.front();q.pop();if(cur.x==ex&&cur.y==ey&&cur.times<=l){if(maxvalue<cur.values) maxvalue=cur.values;}for(i=0;i<4;i++){next.x=cur.x+dir[i][0];next.y=cur.y+dir[i][1];if(judge1(next.x,next.y)){next.times=cur.times+1;next.values=cur.values+g[next.x][next.y];if(judge2(next.x,next.y,next.values,next.times)){q.push(next);time[next.x][next.y]=next.times;value[next.x][next.y]=next.values;g[next.x][next.y]=0;}}}}
}
int main()
{int i,j,t,cou=0;;char ch;cin>>t;while(t--){cou++;cin>>w>>h>>l>>m;for(i=0;i<m;i++) cin>>M[i];getchar();for(i=0;i<h;i++){for(j=0;j<w;j++){cin>>ch;switch(ch){case '*':g[i][j]=-1;break;case '.':g[i][j]=0;break;case '@':g[i][j]=0;sx=i;sy=j;break;case '<':g[i][j]=0;ex=i;ey=j;break;default: g[i][j]=M[ch-'0'-65];break;}}}memset(value,0,sizeof(value));for(i=0;i<h;i++)for(j=0;j<w;j++) time[i][j]=1000001;maxvalue=-1;bfs();cout<<"Case "<<cou<<":"<<endl;if(maxvalue>=0)cout<<"The best score is "<<maxvalue<<"."<<endl<<endl;else cout<<"Impossible"<<endl<<endl;}return 0;
}

#include"iostream"
#include"stdio.h"
#include"algorithm"
#include"cmath"
#include"string.h"
#include"string"
#include"queue"
#define mx 105
using namespace std;
char mp[mx][mx];
bool used[mx][mx];//标记bfs走过的路径
bool vis[mx];//标记 dfs走过的路径
int value[mx];//记录宝物的价值
int H,W,L,M,ans,sum;
int step[mx][mx];//记录每个位置的最小步骤
int dis[mx][mx];//记录出口、入口、宝物两两之间的最短距离
queue<int>q;
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
bool judge(int x,int y)//判断该位置是否可走
{if(x>=0&&x<H&&y>=0&&y<W&&mp[x][y]!='*') return true;return false;
}
void bfs(int x1,int y1,int s)
{while(!q.empty()) q.pop();int dx,dy,i,u,x,y;memset(used,false,sizeof(used));memset(step,0,sizeof(step));u=x1*W+y1;q.push(u);used[x1][y1]=true;step[x1][y1]=0;while(!q.empty()){u=q.front();q.pop();x=u/W;y=u%W;for(i=0;i<4;i++){dx=x+dir[i][0];dy=y+dir[i][1];if(judge(dx,dy)){if(!used[dx][dy]){used[dx][dy]=true;step[dx][dy]=step[x][y]+1;if(mp[dx][dy]=='@')dis[s][0]=step[dx][dy];else if(mp[dx][dy]=='<')dis[s][M+1]=step[dx][dy];else if(mp[dx][dy]>='A'&&mp[dx][dy]<='J')dis[s][mp[dx][dy]-'A'+1]=step[dx][dy];q.push(dx*W+dy);}}}}
}
void dfs(int s,int val,int time)
{int i;if(time>L) return;if(ans==sum) return;if(s>M){if(val>ans)ans=val;return;}for(i=0;i<=M+1;i++){if(dis[s][i]==0||vis[i]) continue;vis[i]=true;dfs(i,value[i]+val,time+dis[s][i]);vis[i]=false;}
}
int main()
{int i,j,t,icase=0;cin>>t;while(t--){sum=0;ans=-1;memset(dis,0,sizeof(dis));//记得初始化disicase++;cin>>W>>H>>L>>M;for(i=1;i<=M;i++) {cin>>value[i];sum+=value[i];}for(i=0;i<H;i++) cin>>mp[i];value[0]=0;value[M+1]=0;for(i=0;i<H;i++){for(j=0;j<W;j++){if(mp[i][j]=='@') bfs(i,j,0);else if(mp[i][j]=='<')bfs(i,j,M+1);else if(mp[i][j]>='A'&&mp[i][j]<='J') bfs(i,j,mp[i][j]-'A'+1);}}memset(vis,false,sizeof(vis));vis[0]=true;dfs(0,0,0);cout<<"Case "<<icase<<":"<<endl;if(ans>0)cout<<"The best score is "<<ans<<"."<<endl;else  cout<<"Impossible"<<endl;if(t) cout<<endl;}
}