#include <bits/stdc++.h>

 using namespace std;

 #define ll long long

 #define ull unsigned long long

 #define mst(a,b) memset((a),(b),sizeof(a))

 #define mp(a,b) make_pair(a,b)

 #define pi acos(-1)

 #define pii pair<int,int>

 #define pb push_back

 #define lowbit(x) ((x)&(-x))

 const int INF = 0x3f3f3f3f;

 const double eps = 1e-;

 const int maxn = 1e5 + ;

 const int maxm = 1e6 + ;

 const ll mod =  1e9 + ;

 int n, m, tot = ;

 map<string, int>ma, have;

 int op[maxn];

 string s[maxn];

 int mx[], g[][], f[][], ans;

 int dfs(int cur, int tot) {

     if(!cur) {

         if(tot > ans)

             return ans = tot, ;

         return ;

     }

     for(int i = , j, u, nxt; i < cur; i++) {

         if(cur - i + tot <= ans)

             return ;

         u = f[tot][i], nxt = ;

         if(mx[u] + tot <= ans)

             return ;

         for(j = i + ; j < cur; j++)

             if(g[u][f[tot][j]])

                 f[tot + ][nxt++] = f[tot][j];

         if(dfs(nxt, tot + ))

             return ;

     }

     return ;

 }

 int main() {

 #ifdef local

     freopen("data.txt", "r", stdin);

 //    freopen("data.txt", "w", stdout);

 #endif

     scanf("%d%d", &m, &n);

     for(int i = ; i <= m; i++) {

         scanf("%d", &op[i]);

         if(op[i] == ) {

             cin >> s[i];

             if(ma.find(s[i]) == ma.end())

                 ma[s[i]] = tot++;

         }

     }

     vector<int>vec;

     for(int i = ; i <= m; i++) {

         if(op[i] == ) {

             have.clear();

             for(int i = ; i < vec.size(); i++) {

                 for(int j = i + ; j < vec.size(); j++) {

                     g[vec[i]][vec[j]] = g[vec[j]][vec[i]] = ;

                 }

             }

             vec.clear();

         } else if(have.find(s[i]) == have.end())

             vec.pb(ma[s[i]]);

     }

     for(int i = ; i < vec.size(); i++) {

         for(int j = i + ; j < vec.size(); j++) {

             g[vec[i]][vec[j]] = g[vec[j]][vec[i]] = ;

         }

     }

     for(int i = ; i < n; i++)

         for(int j = ; j < n; j++)

             g[i][j] ^= ;

     int j,k;

     for(int i = n - ; ~i; dfs(k, ), mx[i--] = ans)

         for(k = , j = i + ; j < n; j++)

             if(g[i][j])

                 f[][k++] = j;

     printf("%d\n", ans);

     return ;

 }