#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <deque> 
#include <queue> 
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <functional> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <cctype> 
#include <string> 
#include <cstring> 
#include <ctime> 

using namespace std;

#define _int64 long long

int neigh[8][2]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}};
int neigh1[8][2]={{1,2},{2,1},{2,-1},{1,-2},{-1,-2},{-2,-1},{-2,1},{-1,2}};
int d[1100][1100];
int d1[1100][1100];

int main()
{
  int i,j,m,n,k,x1,y1,x2,y2,x,y,z,ans,xx,yy,l,t,tmp;
  vector<pair<int,int> > q;
  scanf("%d",&t);
  for (l=0;l<t;l++)
  {
    scanf("%d%d%d",&m,&n,&k);
    scanf("%d%d",&x1,&y1);
    scanf("%d%d",&x2,&y2);
    x1--;y1--;x2--;y2--;
    printf("Case #%d:\n",l+1);
    q.clear();
    q.push_back(make_pair(x1,y1));
    memset(d,-1,sizeof(d));
    for (i=0;i<q.size();i++)
    {
      x=q[i].first;
      y=q[i].second;
      if (i==0) z=0;
      else z=d[x][y];
      for (j=0;j<8;j++)
      {
        xx=x+neigh[j][0];
        yy=y+neigh[j][1];
        if ((xx>=0)&&(xx<m)&&(yy>=0)&&(yy<n)&&(d[xx][yy]==-1))
        {
          d[xx][yy]=z+1;
          q.push_back(make_pair(xx,yy));
        }
      }
    }
    /*
    for (i=0;i<m;i++)
    {
      for (j=0;j<n;j++)
        cout<<d[i][j]<<" ";
      cout<<endl;
    }
    */
    q.clear();
    q.push_back(make_pair(x2,y2));
    memset(d1,-1,sizeof(d1));
    ans=2000000000;
    for (i=0;i<q.size();i++)
    {
      x=q[i].first;
      y=q[i].second;
      if (i==0) z=0;
      else z=d1[x][y];
      for (j=0;j<8;j++)
      {
        xx=x+neigh1[j][0];
        yy=y+neigh1[j][1];
        if ((xx>=0)&&(xx<m)&&(yy>=0)&&(yy<n)&&(d1[xx][yy]==-1))
        {
          d1[xx][yy]=z+1;
          tmp=z+1;
          if (d[xx][yy]>tmp) tmp=d[xx][yy];
          if ((tmp-(z+1))%2!=0) tmp++;
          if (tmp<ans) ans=tmp;
          q.push_back(make_pair(xx,yy));
        }
      }
    }
    /*
    for (i=0;i<m;i++)
    {
      for (j=0;j<n;j++)
        cout<<d1[i][j]<<" ";
      cout<<endl;
    }
    cout<<ans<<endl;*/
    if (ans>k)
      printf("OH,NO!\n");
    else printf("%d\n",ans);
  }
  return 0;
}