Problem: Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.

Today's training is to quickly solve popular puzzles and train your instantaneous power. Today's challenge is a puzzle of colorful tiles lined up and erasing them well.

In the initial state, tiles are placed on some squares on the grid. Each tile is colored. After the game starts, the player can perform the operations shown in the following procedure many times.

1. Select one square without tiles and hit that square.
2. Follow from the hit square to the top, and pay attention to the tile when you reach the square where the tile is placed. If you get to the edge of the board without the squares on which the tiles are placed, you will not pay attention to anything.
3. Perform the same operation from the square you hit to the bottom, left, and right. Up to 4 tiles will be the focus of attention.
4. If any of the tiles of interest have the same color, remove those tiles from the board. If there are two pairs of tiles of the same color, remove both.
5. The score will be the same as the number of tiles removed.
6. Stop paying attention.



For example, consider the following situation. The squares without tiles are periods, and the tile colors are represented by uppercase letters.


..A ......
....... B ..
..........
..B ......
..A.CC ....


Now consider the operation of hitting the squares in the second row from the top and the third column from the left. Since there are three tiles of interest, `A`,` B`, and `B`, the two of` B` disappear and the board becomes as follows, and two points are obtained.


..A ......
..........
..........
..........
..A.CC ....


If this puzzle is slow, the time will run out, and you will not be able to see part of the board and you will not know how much training you lacked. Two tiles of each color are placed, but it is not always possible to erase all of them, so let the program calculate the maximum score in advance.



Input


M N
C1,1 C1,2 ... C1, N
C2,1 C2,2 ... C2, N
...
CM, 1CM, 2 ... CM, N


The integers M and N indicate that the board is a grid of vertical M x horizontal N. Ci and j are uppercase letters or periods (`.`), And for the cells in the i-th row from the top and the j-th column from the left, the uppercase letters indicate the color of the tiles placed, and the period indicates the color of the tile. Indicates that no tile is placed on this square.

Satisfy 1 ≤ M ≤ 500 and 1 ≤ N ≤ 500. Each uppercase letter appears as 0 or 2 as you type.

Output

Output the maximum score on one line.

Examples

Input

5 10
..A.......
.......B..
..........
..B.......
..A.CC....


Output

4


Input

3 3
ABC
D.D
CBA


Output

4


Input

5 7
NUTUBOR
QT.SZRQ
SANAGIP
LMDGZBM
KLKIODP


Output

34

Solution (in CPP):

Solution:
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};
struct info {
	bool samexy;
	set<char> alpha1;
	set<char> alpha2;
};

int main() {
	int h, w;
	cin >> h >> w;
	vector<string> cell(h);
	vector<info> alf(26);
	REP(i, h)
		cin >> cell[i];
	REP(k, 26) {
		int x = -1;
		int y = -1;
		REP(i, h)
			REP(j, w) {
			if (cell[i][j] == 'A' + k) {
				if (x == -1) {
					x = j;
					y = i;
				}
				else {
					if (x == j || y == i)
						alf[k].samexy = true;
					else
						alf[k].samexy = false;
					if (alf[k].samexy) {
						if (x == j) {
							REP(l, abs(y - i) - 1)
								alf[k].alpha1.insert(cell[y + 1 + l][j]);
						}
						else {
							REP(l, abs(x - j) - 1)
								alf[k].alpha1.insert(cell[i][x + 1 + l]);
						}
					}
					else {
						if (x < j&&y < i) {
							REP(l, abs(x - j) - 1)
								alf[k].alpha1.insert(cell[y][x + l + 1]);
							alf[k].alpha1.insert(cell[y][j]);
							REP(l, abs(y - i) - 1)
								alf[k].alpha1.insert(cell[y + 1 + l][j]);
							REP(l, abs(y - i) - 1)
								alf[k].alpha2.insert(cell[y + 1 + l][x]);
							alf[k].alpha2.insert(cell[i][x]);
							REP(l, abs(x - j) - 1)
								alf[k].alpha2.insert(cell[i][x + l + 1]);
						}
						else {
							REP(l, abs(x - j) - 1)
								alf[k].alpha1.insert(cell[y][j + l + 1]);
							alf[k].alpha1.insert(cell[y][j]);
							REP(l, abs(y - i) - 1)
								alf[k].alpha1.insert(cell[y + 1 + l][j]);
							REP(l, abs(y - i) - 1)
								alf[k].alpha2.insert(cell[y + 1 + l][x]);
							alf[k].alpha2.insert(cell[i][x]);
							REP(l, abs(x - j) - 1)
								alf[k].alpha2.insert(cell[i][j + l + 1]);
						}
					}

				}
			}
		}
	}
	bool change = false;
	int ans = 0;
	bool used[26] = { false};
	do {
		change = false;
		REP(i, 26) {
			if(!used[i])
			if (alf[i].samexy) {
				if (!alf[i].alpha1.empty() && alf[i].alpha1.size() == 1 && EXIST(alf[i].alpha1, '.')) {
					ans++;
					used[i] = true;
					change = true;
					REP(j,26)
						if (!used[j]) {
							if (alf[j].samexy) {
								if (!alf[j].alpha1.empty()&&EXIST(alf[j].alpha1,'A'+i)){
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
							}else{
								if (!alf[j].alpha1.empty() && EXIST(alf[j].alpha1, 'A' + i)) {
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
								if (!alf[j].alpha2.empty() && EXIST(alf[j].alpha2, 'A' + i)) {
									alf[j].alpha2.erase('A' + i);
									alf[j].alpha2.insert('.');
								}
							}
						}
				}
			}else{
				if (!alf[i].alpha1.empty() && alf[i].alpha1.size() == 1 && EXIST(alf[i].alpha1, '.')) {
					ans++;
					used[i] = true;
					change = true;
					REP(j, 26)
						if (!used[j]) {
							if (alf[j].samexy) {
								if (!alf[j].alpha1.empty() && EXIST(alf[j].alpha1, 'A' + i)) {
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
							}
							else {
								if (!alf[j].alpha1.empty() && EXIST(alf[j].alpha1, 'A' + i)) {
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
								if (!alf[j].alpha2.empty() && EXIST(alf[j].alpha2, 'A' + i)) {
									alf[j].alpha2.erase('A' + i);
									alf[j].alpha2.insert('.');
								}
							}
						}
				}
				if (used[i])continue;
				if (!alf[i].alpha2.empty() && alf[i].alpha2.size() == 1 && EXIST(alf[i].alpha2, '.')) {
					ans++;
					used[i] = true;
					change = true;
					REP(j, 26)
						if (!used[j]) {
							if (alf[j].samexy) {
								if (!alf[j].alpha1.empty() && EXIST(alf[j].alpha1, 'A' + i)) {
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
							}
							else {
								if (!alf[j].alpha1.empty() && EXIST(alf[j].alpha1, 'A' + i)) {
									alf[j].alpha1.erase('A' + i);
									alf[j].alpha1.insert('.');
								}
								if (!alf[j].alpha2.empty() && EXIST(alf[j].alpha2, 'A' + i)) {
									alf[j].alpha2.erase('A' + i);
									alf[j].alpha2.insert('.');
								}
							}
						}
				}
			}
		}
	} while (change);
	cout << ans * 2 << endl;
}