President of Berland has a very vast office-room, where, apart from him, work his subordinates. Each subordinate, as well as President himself, has his own desk of a unique colour. Each desk is rectangular, and its sides are parallel to the office walls. One day President decided to establish an assembly, of which all his deputies will be members. Unfortunately, he does not remember the exact amount of his deputies, but he remembers that the desk of each his deputy is adjacent to his own desk, that is to say, the two desks (President's and each deputy's) have a common side of a positive length.

The office-room plan can be viewed as a matrix with n rows and m columns. Each cell of this matrix is either empty, or contains a part of a desk. An uppercase Latin letter stands for each desk colour. The «period» character («.») stands for an empty cell. 

Input

The first line contains two separated by a space integer numbers n, m (1 ≤ n, m ≤ 100) — the length and the width of the office-room, and c character — the President's desk colour. The following n lines contain m characters each — the office-room description. It is guaranteed that the colour of each desk is unique, and each desk represents a continuous subrectangle of the given matrix. All colours are marked by uppercase Latin letters.

Output

Print the only number — the amount of President's deputies.

Examples

Input

3 4 R
G.B.
.RR.
TTT.


Output

2


Input

3 3 Z
...
.H.
..Z


Output

0
def main():
       rowsNr, colsNr, presidentColor = input().split()
       desks = []
       #get the input with all information about desks position and color
       for _ in range(int(rowsNr)):
              desks.append(input())
       #define the list of neighbors which we want to check
       neighbors = [[1,0],[0,-1],[-1,0],[0,1]]
       #define the set deputies, because there can be 2 desks with the same color and we don't want to count it twice
       deputies = set()
       #iterate over each desk
       for row in range(int(rowsNr)):
              for col in range(int(colsNr)):
                     #if we found president desk
                     if desks[row][col] == presidentColor:
                            #then we have to look for all neighbors if they exist and put them in the set
                            for neighbor in neighbors:
                                   if row + neighbor[0] < int(rowsNr) and col + neighbor[1] < int(colsNr) and row + neighbor[0] >= 0 and col + neighbor[1] >= 0:
                                          #if it is not an empty desk or president desk
                                          if desks[row + neighbor[0]][col + neighbor[1]] != '.' and desks[row + neighbor[0]][col + neighbor[1]] != presidentColor:
                                                 deputies.add(desks[row + neighbor[0]][col + neighbor[1]])
              
       print(len(deputies))


main()