Problem: Warawreh created a great company called Nanosoft. The only thing that Warawreh still has to do is to place a large picture containing its logo on top of the company's building.

The logo of Nanosoft can be described as four squares of the same size merged together into one large square. The top left square is colored with red, the top right square is colored with green, the bottom left square is colored with yellow and the bottom right square is colored with blue.

An Example of some correct logos:

<image>

An Example of some incorrect logos:

<image>

Warawreh went to Adhami's store in order to buy the needed picture. Although Adhami's store is very large he has only one picture that can be described as a grid of n rows and m columns. The color of every cell in the picture will be green (the symbol 'G'), red (the symbol 'R'), yellow (the symbol 'Y') or blue (the symbol 'B').

Adhami gave Warawreh q options, in every option he gave him a sub-rectangle from that picture and told him that he can cut that sub-rectangle for him. To choose the best option, Warawreh needs to know for every option the maximum area of sub-square inside the given sub-rectangle that can be a Nanosoft logo. If there are no such sub-squares, the answer is 0.

Warawreh couldn't find the best option himself so he asked you for help, can you help him?

Input

The first line of input contains three integers n, m and q (1 ≤ n , m ≤ 500, 1 ≤ q ≤ 3 ⋅ 10^{5}) — the number of row, the number columns and the number of options.

For the next n lines, every line will contain m characters. In the i-th line the j-th character will contain the color of the cell at the i-th row and j-th column of the Adhami's picture. The color of every cell will be one of these: {'G','Y','R','B'}.

For the next q lines, the input will contain four integers r_1, c_1, r_2 and c_2 (1 ≤ r_1 ≤ r_2 ≤ n, 1 ≤ c_1 ≤ c_2 ≤ m). In that option, Adhami gave to Warawreh a sub-rectangle of the picture with the upper-left corner in the cell (r_1, c_1) and with the bottom-right corner in the cell (r_2, c_2).

Output

For every option print the maximum area of sub-square inside the given sub-rectangle, which can be a NanoSoft Logo. If there are no such sub-squares, print 0.

Examples

Input


5 5 5
RRGGB
RRGGY
YYBBG
YYBBR
RBBRG
1 1 5 5
2 2 5 5
2 2 3 3
1 1 3 5
4 4 5 5


Output


16
4
4
4
0


Input


6 10 5
RRRGGGRRGG
RRRGGGRRGG
RRRGGGYYBB
YYYBBBYYBB
YYYBBBRGRG
YYYBBBYBYB
1 1 6 10
1 3 3 10
2 2 6 6
1 7 6 10
2 1 5 10


Output


36
4
16
16
16


Input


8 8 8
RRRRGGGG
RRRRGGGG
RRRRGGGG
RRRRGGGG
YYYYBBBB
YYYYBBBB
YYYYBBBB
YYYYBBBB
1 1 8 8
5 2 5 7
3 1 8 6
2 3 5 8
1 2 6 8
2 1 5 5
2 1 7 7
6 5 7 5


Output


64
0
16
4
16
4
36
0

Note

Picture for the first test:

<image>

The pictures from the left to the right corresponds to the options. The border of the sub-rectangle in the option is marked with black, the border of the sub-square with the maximal possible size, that can be cut is marked with gray.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m, q, f[510][510][12][12], Pow[12], sum[510][510][5];
char mp[510][510];
int getsum(int xa, int ya, int xb, int yb, int k) {
  if (xa < 1 || ya < 1 || xb > n || yb > m || xa > xb || ya > yb) return -1;
  return sum[xb][yb][k] - sum[xa - 1][yb][k] - sum[xb][ya - 1][k] +
         sum[xa - 1][ya - 1][k];
}
int Max(int a, int b, int c, int d) { return max(a, max(b, max(c, d))); }
bool check(int x, int y, int k) {
  if (k == 0) return true;
  int a = getsum(x - k + 1, y - k + 1, x, y, 1);
  int b = getsum(x - k + 1, y + 1, x, y + k, 2);
  int c = getsum(x + 1, y - k + 1, x + k, y, 3);
  int d = getsum(x + 1, y + 1, x + k, y + k, 4);
  if (a == k * k && b == k * k && c == k * k && d == k * k) return true;
  return false;
}
int work(int x, int y) {
  int l = 0, r = min(n, m), mid, res;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (check(x, y, mid)) {
      res = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  return res;
}
void RMQ_init() {
  for (int k = 1; k < 10; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j + Pow[k] - 1 <= m; j++) {
        f[i][j][0][k] = max(f[i][j][0][k - 1], f[i][j + Pow[k - 1]][0][k - 1]);
      }
    }
  }
  for (int k = 1; k < 10; k++) {
    for (int i = 1; i + Pow[k] - 1 <= n; i++) {
      for (int j = 1; j <= m; j++) {
        f[i][j][k][0] = max(f[i][j][k - 1][0], f[i + Pow[k - 1]][j][k - 1][0]);
      }
    }
  }
  for (int k = 1; k < 10; k++) {
    for (int l = 1; l < 10; l++) {
      for (int i = 1; i + Pow[k] - 1 <= n; i++) {
        for (int j = 1; j + Pow[l] - 1 <= m; j++) {
          f[i][j][k][l] =
              Max(f[i][j][k - 1][l - 1], f[i + Pow[k - 1]][j][k - 1][l - 1],
                  f[i][j + Pow[l - 1]][k - 1][l - 1],
                  f[i + Pow[k - 1]][j + Pow[l - 1]][k - 1][l - 1]);
        }
      }
    }
  }
}
bool judge(int xa, int ya, int xb, int yb, int k) {
  if (k == 0) return true;
  if (xa < 1 || ya < 1 || xb > n || yb > m || xa > xb || ya > yb) return false;
  int t1 = 0, t2 = 0;
  while (xa + Pow[t1] - 1 <= xb) t1++;
  while (ya + Pow[t2] - 1 <= yb) t2++;
  t1--, t2--;
  return Max(f[xa][ya][t1][t2], f[xb - Pow[t1] + 1][ya][t1][t2],
             f[xa][yb - Pow[t2] + 1][t1][t2],
             f[xb - Pow[t1] + 1][yb - Pow[t2] + 1][t1][t2]) >= k;
}
int query(int xa, int ya, int xb, int yb) {
  int l = 0, r = min(n, m), mid, res;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (judge(xa + mid - 1, ya + mid - 1, xb - mid, yb - mid, mid)) {
      res = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  return res * res * 4;
}
int main() {
  Pow[0] = 1;
  for (int i = 1; i <= 10; i++) {
    Pow[i] = (Pow[i - 1] << 1);
  }
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%s", mp[i] + 1);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (mp[i][j] == 'R') sum[i][j][1] = 1;
      if (mp[i][j] == 'G') sum[i][j][2] = 1;
      if (mp[i][j] == 'Y') sum[i][j][3] = 1;
      if (mp[i][j] == 'B') sum[i][j][4] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      for (int k = 1; k <= 4; k++) {
        sum[i][j][k] +=
            sum[i - 1][j][k] + sum[i][j - 1][k] - sum[i - 1][j - 1][k];
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      f[i][j][0][0] = work(i, j);
    }
  }
  RMQ_init();
  int xa, xb, ya, yb;
  while (q--) {
    scanf("%d %d %d %d", &xa, &ya, &xb, &yb);
    printf("%d\n", query(xa, ya, xb, yb));
  }
  return 0;
}