Problem: Autumn came late to the kingdom of Far Far Away. The harvest was exuberant and it is now time to get ready for the winter. As most people celebrate the Harvest festival, Simon the Caretaker tries to solve a very non-trivial task of how to find place for the agricultural equipment in the warehouse.

He's got problems with some particularly large piece of equipment, which is, of course, turboplows. The problem is that when a turboplow is stored, it takes up not some simply rectangular space. It takes up a T-shaped space like on one of the four pictures below (here character "#" stands for the space occupied by the turboplow and character "." stands for the free space):
    
    
    ###      ..#      .#.      #..  
    .#.      ###      .#.      ###  
    .#.      ..#      ###      #..  
    

Simon faced a quite natural challenge: placing in the given n × m cells warehouse the maximum number of turboplows. As one stores the turboplows, he can rotate them in any manner (so that they take up the space like on one of the four pictures above). However, two turboplows cannot "overlap", that is, they cannot share the same cell in the warehouse.

Simon feels that he alone cannot find the optimal way of positioning the plugs in the warehouse that would maximize their quantity. Can you help him?

Input

The only line contains two space-separated integers n and m — the sizes of the warehouse (1 ≤ n, m ≤ 9).

Output

In the first line print the maximum number of turboplows that can be positioned in the warehouse. In each of the next n lines print m characters. Use "." (dot) to mark empty space and use successive capital Latin letters ("A" for the first turboplow, "B" for the second one and so on until you reach the number of turboplows in your scheme) to mark place for the corresponding turboplows considering that they are positioned in the optimal manner in the warehouse. The order in which you number places for the turboplows does not matter. If there are several optimal solutions for a warehouse of the given size, print any of them.

Examples

Input

3 3


Output

1
AAA
.A.
.A.


Input

5 6


Output

4
A..C..
AAAC..
ABCCCD
.B.DDD
BBB..D


Input

2 2


Output

0
..
..

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int dd[4][5][2] = {{{0, 0}, {1, 0}, {2, 0}, {0, 1}, {0, -1}},
                   {{0, 0}, {-1, 0}, {-2, 0}, {0, 1}, {0, -1}},
                   {{0, 0}, {0, 1}, {0, 2}, {1, 0}, {-1, 0}},
                   {{0, 0}, {0, -1}, {0, -2}, {1, 0}, {-1, 0}}};
char grf[15][15], grf2[15][15];
int n, m;
int ans;
bool can(int x, int y) {
  return x >= 0 && x < n && y >= 0 && y < m && grf[x][y] == '.';
}
void dfs(int now) {
  if (now > ans) {
    ans = now;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        grf2[i][j] = grf[i][j];
      }
    }
  }
  bool fnd = 0;
  int cntfnd = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (fnd) {
        cntfnd++;
      }
      if (cntfnd > 2) {
        return;
      }
      for (int k = 0; k < 4; k++) {
        bool shit = 0;
        for (int l = 0; l < 5; l++) {
          if (!can(i + dd[k][l][0], j + dd[k][l][1])) {
            shit = 1;
            break;
          }
        }
        if (shit) {
          continue;
        }
        fnd = 1;
        for (int l = 0; l < 5; l++) {
          grf[i + dd[k][l][0]][j + dd[k][l][1]] = now + 'A';
        }
        dfs(now + 1);
        for (int l = 0; l < 5; l++) {
          grf[i + dd[k][l][0]][j + dd[k][l][1]] = '.';
        }
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  memset((char*)grf, '.', sizeof(grf));
  memset((char*)grf2, '.', sizeof(grf2));
  dfs(0);
  cout << ans << endl;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << grf2[i][j];
    }
    cout << endl;
  }
  return 0;
}