Problem: Vasya has a pack of 54 cards (52 standard cards and 2 distinct jokers). That is all he has at the moment. Not to die from boredom, Vasya plays Solitaire with them.

Vasya lays out nm cards as a rectangle n × m. If there are jokers among them, then Vasya should change them with some of the rest of 54 - nm cards (which are not layed out) so that there were no jokers left. Vasya can pick the cards to replace the jokers arbitrarily. Remember, that each card presents in pack exactly once (i. e. in a single copy). Vasya tries to perform the replacements so that the solitaire was solved.

Vasya thinks that the solitaire is solved if after the jokers are replaced, there exist two non-overlapping squares 3 × 3, inside each of which all the cards either have the same suit, or pairwise different ranks.

Determine by the initial position whether the solitaire can be solved or not. If it can be solved, show the way in which it is possible.

Input

The first line contains integers n and m (3 ≤ n, m ≤ 17, n × m ≤ 52). Next n lines contain m words each. Each word consists of two letters. The jokers are defined as "J1" and "J2" correspondingly. For the rest of the cards, the first letter stands for the rank and the second one — for the suit. The possible ranks are: "2", "3", "4", "5", "6", "7", "8", "9", "T", "J", "Q", "K" and "A". The possible suits are: "C", "D", "H" and "S". All the cards are different.

Output

If the Solitaire can be solved, print on the first line "Solution exists." without the quotes. On the second line print in what way the jokers can be replaced. Three variants are possible:

  * "There are no jokers.", if there are no jokers in the input data.
  * "Replace Jx with y.", if there is one joker. x is its number, and y is the card it should be replaced with.
  * "Replace J1 with x and J2 with y.", if both jokers are present in the input data. x and y here represent distinct cards with which one should replace the first and the second jokers correspondingly.



On the third line print the coordinates of the upper left corner of the first square 3 × 3 in the format "Put the first square to (r, c).", where r and c are the row and the column correspondingly. In the same manner print on the fourth line the coordinates of the second square 3 × 3 in the format "Put the second square to (r, c).".

If there are several solutions to that problem, print any of them.

If there are no solutions, print of the single line "No solution." without the quotes.

See the samples to understand the output format better.

Examples

Input

4 6
2S 3S 4S 7S 8S AS
5H 6H 7H 5S TC AC
8H 9H TH 7C 8C 9C
2D 2C 3C 4C 5C 6C


Output

No solution.

Input

4 6
2S 3S 4S 7S 8S AS
5H 6H 7H J1 TC AC
8H 9H TH 7C 8C 9C
2D 2C 3C 4C 5C 6C


Output

Solution exists.
Replace J1 with 2H.
Put the first square to (1, 1).
Put the second square to (2, 4).


Input

4 6
2S 3S 4S 7S 8S AS
5H 6H 7H QC TC AC
8H 9H TH 7C 8C 9C
2D 2C 3C 4C 5C 6C


Output

Solution exists.
There are no jokers.
Put the first square to (1, 1).
Put the second square to (2, 4).

Note

The pretests cover all the possible output formats.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m, a[20][20], ff[20][20];
bool flag[60], fnum[20];
char word[15] = "A23456789TJQK";
char suit[5] = "CDHS", x, y;
bool OL(int i, int j, int ii, int jj) {
  if (ii >= i && ii < i + 3 && jj >= j && jj < j + 3) return true;
  if (ii >= i && ii < i + 3 && jj + 2 >= j && jj + 2 < j + 3) return true;
  if (ii + 2 >= i && ii + 2 < i + 3 && jj >= j && jj < j + 3) return true;
  if (ii + 2 >= i && ii + 2 < i + 3 && jj + 2 >= j && jj + 2 < j + 3)
    return true;
  return false;
}
void Find(int k) {
  int i = k / 13, j = k % 13;
  x = word[j];
  y = suit[i];
}
bool OK(int ii, int jj) {
  bool tag[20], t1, t2;
  int i, j, s1;
  memset(tag, false, sizeof(tag));
  s1 = a[ii][jj] / 13;
  t1 = false, t2 = false;
  for (i = 0; i < 3; i++)
    for (j = 0; j < 3; j++) {
      if (a[i + ii][j + jj] / 13 != s1) t1 = true;
      if (tag[a[ii + i][jj + j] % 13])
        t2 = true;
      else
        tag[a[ii + i][jj + j] % 13] = true;
    }
  if (t1 && t2) return false;
  return true;
}
bool Good(int &i, int &j, int &ii, int &jj) {
  for (i = 0; i < n - 2; i++)
    for (j = 0; j < m - 2; j++) {
      for (ii = i; ii < n - 2; ii++)
        for (jj = 0; jj < m - 2; jj++) {
          if (ii == i && jj <= j) continue;
          if (OL(i, j, ii, jj)) continue;
          if (OK(i, j) && OK(ii, jj)) return true;
        }
    }
  return false;
}
int main() {
  int i, j, ii, jj, x1, x2, y1, y2, k1, k2;
  char ss[10];
  bool tag;
  while (scanf("%d%d", &n, &m) != EOF) {
    memset(flag, false, sizeof(flag));
    memset(a, -1, sizeof(a));
    x1 = y1 = x2 = y2 = -1;
    for (i = 0; i < n; i++)
      for (j = 0; j < m; j++) {
        scanf("%s", ss);
        if (!strcmp(ss, "J1")) {
          a[i][j] = 60;
          x1 = i, y1 = j;
        } else if (!strcmp(ss, "J2")) {
          a[i][j] = 70;
          x2 = i, y2 = j;
        } else {
          for (ii = 0; ii < 13; ii++)
            if (word[ii] == ss[0]) break;
          for (jj = 0; jj < 4; jj++)
            if (suit[jj] == ss[1]) break;
          a[i][j] = jj * 13 + ii;
          flag[jj * 13 + ii] = true;
        }
      }
    memset(ff, 0, sizeof(ff));
    tag = false;
    if (x1 != -1) {
      for (k1 = 0; k1 < 52 && !tag; k1++)
        if (!flag[k1]) {
          a[x1][y1] = k1;
          if (x2 != -1) {
            for (k2 = 0; k2 < 52 && !tag; k2++)
              if (!flag[k2] && k2 != k1) {
                a[x2][y2] = k2;
                if (Good(i, j, ii, jj)) {
                  tag = true;
                  printf("Solution exists.\n");
                  Find(k1);
                  printf("Replace J1 with %c%c", x, y);
                  Find(k2);
                  printf(" and J2 with %c%c.\n", x, y);
                  printf("Put the first square to (%d, %d).\n", i + 1, j + 1);
                  printf("Put the second square to (%d, %d).\n", ii + 1,
                         jj + 1);
                  break;
                }
              }
          } else {
            if (Good(i, j, ii, jj)) {
              tag = true;
              printf("Solution exists.\n");
              Find(k1);
              printf("Replace J1 with %c%c.\n", x, y);
              printf("Put the first square to (%d, %d).\n", i + 1, j + 1);
              printf("Put the second square to (%d, %d).\n", ii + 1, jj + 1);
              break;
            }
          }
        }
    } else {
      if (x2 != -1) {
        for (k2 = 0; k2 < 52; k2++)
          if (!flag[k2]) {
            a[x2][y2] = k2;
            if (Good(i, j, ii, jj)) {
              tag = true;
              printf("Solution exists.\n");
              Find(k2);
              printf("Replace J2 with %c%c.\n", x, y);
              printf("Put the first square to (%d, %d).\n", i + 1, j + 1);
              printf("Put the second square to (%d, %d).\n", ii + 1, jj + 1);
              break;
            }
          }
      } else {
        if (Good(i, j, ii, jj)) {
          tag = true;
          printf("Solution exists.\n");
          printf("There are no jokers.\n");
          printf("Put the first square to (%d, %d).\n", i + 1, j + 1);
          printf("Put the second square to (%d, %d).\n", ii + 1, jj + 1);
          break;
        }
      }
    }
    if (!tag) printf("No solution.\n");
  }
  return 0;
}