/*
Arpon Raksit
ACSL Contest 4
Intermediate
Division
*/
import java.io.*;
import java.util.*;
public class ACSL_Contest_4
{
public
static void main (String args[]) throws IOException
{
BufferedReader f = new
BufferedReader(new InputStreamReader(System.in));
for (int run = 0; run < 5; run++)
{
StringTokenizer s = new
StringTokenizer(f.readLine(), " ,");
int i, j, k;
char[][] b = new char[8][8];
int[][] opt = new int[8][8];
int[][] dir = {{-1, 0}, {-1, 1}, {0,
1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}};
for (i = 0; i < 8; i++)
for
(j = 0; j < 8; j++)
b[i][j] = ' ';
int num_x =
Integer.parseInt(s.nextToken());
int[][] x = new int[num_x][2];
for (i = 0; i < num_x; i++)
{
String
input = s.nextToken();
x[i][0]
= 8 - ((int)input.charAt(0) - '0');
x[i][1]
= (int)input.charAt(1) - 'A';
b[x[i][0]][x[i][1]]
= 'X';
}
int num_o =
Integer.parseInt(s.nextToken());
int[][] o = new int[num_o][2];
for (i = 0; i < num_o; i++)
{
String
input = s.nextToken();
o[i][0]
= 8 - ((int)input.charAt(0) - '0');
o[i][1]
= (int)input.charAt(1) - 'A';
b[o[i][0]][o[i][1]]
= 'O';
}
for (i = 0; i < num_x; i++)
for
(j = 0; j < 8; j++)
{
k = 1;
while (x[i][0] + k * dir[j][0] >= 0 && x[i][0]
+ k * dir[j][0] < 8 &&
x[i][1] + k * dir[j][1] >= 0 && x[i][1] + k * dir[j][1] <
8 &&
b[x[i][0] + k * dir[j][0]][x[i][1] + k * dir[j][1]] == 'O')
k++;
int r = x[i][0] + k * dir[j][0], c = x[i][1] + k *
dir[j][1];
if (k > 1 && r >= 0 && r < 8
&& c >= 0 && c < 8 && b[r][c] == ' ' && k
> opt[r][c])
opt[r][c]
= k;
}
int best = 0, nbest = 0;
for (i = 0; i < 8; i++)
for
(j = 0; j < 8; j++)
if (opt[i][j] > best)
{
best =
opt[i][j];
nbest =
1;
}
else if (opt[i][j] == best)
nbest++;
if (best == 0)
System.out.println("NONE");
else
{
int
done = 0;
for
(i = 0; i < 8; i++)
for (j = 0; j < 8; j++)
if
(opt[i][j] == best)
{
done++;
if
(done == nbest)
{
System.out.print(8 - i);
System.out.println((char)('A' + j));
}
else
{
System.out.print(8 - i);
System.out.print((char)('A' + j));
System.out.print(", ");
}
}
}
}
}
}