A string of characters consisting of lowercase letters of the English alphabet and question marks is
called a parameterized word (e.g.,
??). Two parameterized words are considered similar
if the question mark symbols in both words can be replaced by arbitrary lowercase letters of the
english alphabet so that the resulting strings are the same. For example, parameterized words
?b?a are similar because by replacing the question marks in both words it is possible to obtain
Mirko has recently bought a collection of parametrized words. Among the words found in the collection, Mirko is interested in how many pairs of similar parameterized words exist. All the words in the collection have the same number of characters, , and it is possible that a word occurs multiple times in the collection.
The first line contains the integer numbers and . Each of the following lines contains one parameterized word from the collection with exactly characters.
Print the total number of similar pairs of parameterized words.
In the test samples totally worth 30% of the points it will be valid . In the test samples totally worth additional 30% points it will be valid .
Sample Input 1
3 3 ??b c?? c?c
Sample Output 1
Explanation for Sample Output 1
Pairs of similar words are: (
c??) and (
Sample Input 2
4 6 ab??c? ??kll? a?k??c ?bcd??
Sample Output 2
Sample Input 3
5 2 ?? b? c? ?g cg
Sample Output 3