#include "cstdio"
#include "string"
#include "cstring"
#include "iostream"
#include "queue"
using namespace std;
char map[85][85];
int n,m,T,p,no,sx,sy,ex,ey,vis[85][85][85],dir[4][2]={-1,0,1,0,0,-1,0,1};
struct status
{int x,y,dep,mana;status(int x,int y,int dep,int mana):x(x),y(y),dep(dep),mana(mana) {}bool operator < (const status &a) const {return dep > a.dep;}
};
int bfs(int x,int y,int mana)
{priority_queue<status> Q;Q.push(status(x,y,0,mana));vis[x][y][mana]=1;while(!Q.empty()){status t=Q.top();Q.pop();if(t.dep>=T) return -1;for(int s=0;s<4;s++){int X=t.x+dir[s][0],Y=t.y+dir[s][1];if(X<1||X>n||Y<1||Y>m||map[X][Y]=='#') continue;if(map[X][Y]=='@'){if(t.mana<1||vis[X][Y][t.mana-1]) continue;vis[X][Y][t.mana-1]=true;Q.push(status(X,Y,t.dep+1,t.mana-1));}else{if(map[t.x][t.y]=='@'&&t.mana<1) continue;if(X==ex&&Y==ey){if(t.mana>=1) return t.dep+1;else return t.dep+2;}if(t.mana>=1||map[t.x][t.y]=='@'){if(!vis[X][Y][t.mana-1]) {vis[X][Y][t.mana-1]=true;Q.push(status(X,Y,t.dep+1,t.mana-1));}}if(map[t.x][t.y]!='@'&&!vis[X][Y][t.mana]) {vis[X][Y][t.mana]=true;Q.push(status(X,Y,t.dep+2,t.mana));}}}}return -1;
}
int main()
{//freopen("in.txt","r",stdin);ios::sync_with_stdio(false);string tt;while(cin>>n>>m>>T>>p){memset(vis,0,sizeof(vis));for(int i=1;i<=n;i++){cin>>tt;for(int j=0;j<tt.size();j++){map[i][j+1]=tt[j];if(tt[j]=='Y') {sx=i;sy=j+1;}if(tt[j]=='L') {ex=i;ey=j+1;}}}int ans=bfs(sx,sy,p);cout<<"Case "<<++no<<":"<<endl;if(ans>T||ans==-1) cout<<"Poor Yifenfei, he has to wait another ten thousand years."<<endl;else cout<<"Yes, Yifenfei will kill Lemon at "<<ans<<" sec."<<endl;}
}