Helping Hiasat

Description:

Input:

The first line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n \le 10^5, 1 \le m \le 40$$$) — the number of events and the number of friends.

Then $$$n$$$ lines follow, each denoting an event of one of two types:

• $$$1$$$ — Hiasat can change his handle.
• $$$2$$$ $$$s$$$ — friend $$$s$$$ ($$$1 \le |s| \le 40$$$) visits Hiasat's profile.

It's guaranteed, that each friend's name consists only of lowercase Latin letters.

It's guaranteed, that the first event is always of the first type and each friend will visit Hiasat's profile at least once.

Output:

Print a single integer — the maximum number of happy friends.

Sample Input:

5 3
1
2 motarack
2 mike
1
2 light

Sample Output:

2

Sample Input:

4 3
1
2 alice
2 bob
2 tanyaromanova

Sample Output:

1

Note:

In the first example, the best way is to change the handle to the "motarack" in the first event and to the "light" in the fourth event. This way, "motarack" and "light" will be happy, but "mike" will not.

In the second example, you can choose either "alice", "bob" or "tanyaromanova" and only that friend will be happy.