Hiasat registered a new account in NeckoForces and when his friends found out about that, each one of them asked to use his name as Hiasat's handle.
Luckily for Hiasat, he can change his handle in some points in time. Also he knows the exact moments friends will visit his profile page. Formally, you are given a sequence of events of two types:
$1$— Hiasat can change his handle.$2$$s$— friend$s$visits Hiasat's profile.
The friend $s$ will be happy, if each time he visits Hiasat's profile his handle would be $s$.
Hiasat asks you to help him, find the maximum possible number of happy friends he can get.
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.
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.
样例
5 3
1
2 motarack
2 mike
1
2 light
2
4 3
1
2 alice
2 bob
2 tanyaromanova
1
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。