#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<map>
using namespace std;
#define N 1005
const int xt[]={-2,-2,2,2,-1,-1,1,1};
const int yt[]={1,-1,1,-1,2,-2,2,-2};
int dis[N][N];
bool vis[N][N],p[N][N];
int ex,ey,x,y,q1[N*N],q2[N*N];
int tot=0,n,m,k;
bool range(int x,int y){
     return x>0 && x<=n && y>0 && y<=m;
     }
void solved(){
     printf("Case #%d:\n",++tot);
     scanf("%d%d%d",&n,&m,&k);
     for(int i=1;i<=n;i++)
       for(int j=1;j<=m;j++)p[i][j]=vis[i][j]=0,dis[i][j]=k+1;
     int ex,ey,x,y;
     scanf("%d%d%d%d",&ex,&ey,&x,&y);
     int t=0,w=1;
     q1[1]=x;
     q2[1]=y;
     vis[x][y]=1;
     dis[x][y]=0;
     while(t<w){
       ++t;
       x=q1[t];y=q2[t];
       for(int i=0;i<8;i++)
         if(range(x+xt[i],y+yt[i])){
           int xx=x+xt[i],yy=y+yt[i];
           p[x][y]=1;
           if(vis[xx][yy])continue;
           vis[xx][yy]=1;
           dis[xx][yy]=dis[x][y]+1;
           q1[++w]=xx;
           q2[w]=yy;
         }
     }
     int ans=k+1;
     for(int i=1;i<=n;i++)
       for(int j=1;j<=m;j++)
         if(vis[i][j]){
           int t1=max(abs(ex-i),abs(ey-j)),t2=dis[i][j];
           if(t1==t2)ans=min(ans,t1);
           else 
           if(abs(t1-t2)%2==0){
             if(t1<t2)ans=min(ans,t2);
             else
             if(p[i][j])ans=min(ans,t1);
           }
         }
     if(ans<=k)printf("%d\n",ans);
     else printf("OH,NO!\n");
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--)solved();
    return 0;
}