#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char s[110][110];
int vst[110][110];
int dst[110][110];
int dx[] = {2, -2, -2, 2};
int dy[] = {-2, -2, 2, 2};
pair<int, int> p[3];
queue<pair<int, int> > q;
int main() {
  int T;
  gn(T);
  while (T--) {
    int nn = 0;
    for (int i = 1; i <= 8; i++) {
      for (int j = 1; j <= 8; j++) {
        scanf(" %c", s[i] + j);
        if (s[i][j] == 'K') p[nn++] = pair<int, int>(i, j);
        dst[i][j] = 0x3f3f3f3f;
      }
    }
    q = queue<pair<int, int> >();
    q.push(p[0]);
    dst[p[0].first][p[0].second] = 0;
    while (!q.empty()) {
      pair<int, int> u = q.front();
      q.pop();
      for (int i = 0; i < 4; i++) {
        pair<int, int> v = pair<int, int>(u.first + dx[i], u.second + dy[i]);
        if (v.first < 1 || v.first > 8) continue;
        if (v.second < 1 || v.second > 8) continue;
        if (dst[v.first][v.second] > dst[u.first][u.second] + 1) {
          dst[v.first][v.second] = dst[u.first][u.second] + 1;
          q.push(v);
        }
      }
    }
    int dd = dst[p[1].first][p[1].second];
    if (dd < 0x3f3f3f3f && dd % 2 == 0)
      puts("YES");
    else
      puts("NO");
  }
}
