Sereja has m non-empty sets of integers A₁, A₂, ..., A_m. What a lucky coincidence! The given sets are a partition of the set of all integers from 1 to n. In other words, for any integer v (1 ≤ v ≤ n) there is exactly one set A_t such that . Also Sereja has integer d.

Sereja decided to choose some sets from the sets he has. Let's suppose that i₁, i₂, ..., i_k (1 ≤ i₁ < i₂ < ... < i_k ≤ m) are indexes of the chosen sets. Then let's define an array of integers b, sorted in ascending order, as a union of the chosen sets, that is, . We'll represent the element with number j in this array (in ascending order) as b_j. Sereja considers his choice of sets correct, if the following conditions are met:

Sereja wants to know what is the minimum number of sets (k) that he can choose so that his choice will be correct. Help him with that.

The first line contains integers n, m, d (1 ≤ d ≤ n ≤ 10⁵, 1 ≤ m ≤ 20). The next m lines contain sets. The first number in the i-th line is s_i (1 ≤ s_i ≤ n). This number denotes the size of the i-th set. Then the line contains s_i distinct integers from 1 to n — set A_i.

It is guaranteed that the sets form partition of all integers from 1 to n.

In a single line print the answer to the problem — the minimum value k at the right choice.