You like the card board game "Set". Each card contains $k$ features, each of which is equal to a value from the set $\{0, 1, 2\}$. The deck contains all possible variants of cards, that is, there are $3^k$ different cards in total.

A feature for three cards is called good if it is the same for these cards or pairwise distinct. Three cards are called a set if all $k$ features are good for them.

For example, the cards $(0, 0, 0)$, $(0, 2, 1)$, and $(0, 1, 2)$ form a set, but the cards $(0, 2, 2)$, $(2, 1, 2)$, and $(1, 2, 0)$ do not, as, for example, the last feature is not good.

A group of five cards is called a meta-set, if there is strictly more than one set among them. How many meta-sets there are among given $n$ distinct cards?


-----Input-----

The first line of the input contains two integers $n$ and $k$ ($1 \le n \le 10^3$, $1 \le k \le 20$) — the number of cards on a table and the number of card features. The description of the cards follows in the next $n$ lines.

Each line describing a card contains $k$ integers $c_{i, 1}, c_{i, 2}, \ldots, c_{i, k}$ ($0 \le c_{i, j} \le 2$) — card features. It is guaranteed that all cards are distinct.


-----Output-----

Output one integer — the number of meta-sets.


-----Examples-----

Input
8 4
0 0 0 0
0 0 0 1
0 0 0 2
0 0 1 0
0 0 2 0
0 1 0 0
1 0 0 0
2 2 0 0
Output
1
Input
7 4
0 0 0 0
0 0 0 1
0 0 0 2
0 0 1 0
0 0 2 0
0 1 0 0
0 2 0 0
Output
3
Input
9 2
0 0
0 1
0 2
1 0
1 1
1 2
2 0
2 1
2 2
Output
54
Input
20 4
0 2 0 0
0 2 2 2
0 2 2 1
0 2 0 1
1 2 2 0
1 2 1 0
1 2 2 1
1 2 0 1
1 1 2 2
1 1 0 2
1 1 2 1
1 1 1 1
2 1 2 0
2 1 1 2
2 1 2 1
2 1 1 1
0 1 1 2
0 0 1 0
2 2 0 0
2 0 0 2
Output
0


-----Note-----

Let's draw the cards indicating the first four features. The first feature will indicate the number of objects on a card: $1$, $2$, $3$. The second one is the color: red, green, purple. The third is the shape: oval, diamond, squiggle. The fourth is filling: open, striped, solid.

You can see the first three tests below. For the first two tests, the meta-sets are highlighted.

In the first test, the only meta-set is the five cards $(0000,\ 0001,\ 0002,\ 0010,\ 0020)$. The sets in it are the triples $(0000,\ 0001,\ 0002)$ and $(0000,\ 0010,\ 0020)$. Also, a set is the triple $(0100,\ 1000,\ 2200)$ which does not belong to any meta-set.

In the second test, the following groups of five cards are meta-sets: $(0000,\ 0001,\ 0002,\ 0010,\ 0020)$, $(0000,\ 0001,\ 0002,\ 0100,\ 0200)$, $(0000,\ 0010,\ 0020,\ 0100,\ 0200)$.

In there third test, there are $54$ meta-sets.

Source: codeforces | Difficulty: MEDIUM_HARD
Tags: String algorithms

Combinatorics

Complete search

Mathematics

Data structures


Solutions:
(n, k) = map(int, input().split())
cards = [tuple(map(int, input().split())) for _ in range(n)]
(cards_lookup, counter) = ({card: i for (i, card) in enumerate(cards)}, [0] * (n + 1))
for i in range(len(cards) - 1):
	for j in range(i + 1, len(cards)):
		counter[cards_lookup.get(tuple((x if x == y else (x + 1 ^ y + 1) - 1 for (x, y) in zip(cards[i], cards[j]))), -1)] += 1
print(sum((x * (x - 1) // 2 for x in counter[:-1])))


from collections import defaultdict
import sys
input = lambda : sys.stdin.readline().rstrip()
in_il = lambda : list(map(int, input().split()))
in_sl = lambda : input().split()
in_i = lambda : int(input())
MAX_INT = float('inf')

def solve():
	(n, k) = in_il()
	cards = []
	cards_set = set()
	card_part_of_sets = defaultdict(set)
	for _ in range(n):
		card = in_il()
		cards.append(card)
		cards_set.add(tuple(card))

	def get_third(a, b):
		third = [None] * k
		for i in range(k):
			if a[i] == b[i]:
				third[i] = a[i]
			else:
				third[i] = 3 - a[i] - b[i]
		third = tuple(third)
		return third if third in cards_set else None
	for i in range(n):
		for j in range(i + 1, n):
			third = get_third(cards[i], cards[j])
			if third != None:
				cardset = [tuple(cards[i]), tuple(cards[j]), third]
				cardset.sort()
				cardset = tuple(cardset)
				card_part_of_sets[tuple(cards[i])].add(cardset)
				card_part_of_sets[tuple(cards[j])].add(cardset)
				card_part_of_sets[third].add(cardset)
	meta = 0
	for v in card_part_of_sets.values():
		count = len(v)
		meta += count * (count - 1) // 2
	print(meta)
solve()