#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int MAXN = 1e5 + 5;
const int MAXM = 2e6 + 5;
const int MOD = 1e9 + 7;
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  if (x < 0)
    return -1;
  else
    return 1;
}
long long pw(long long a, long long n, long long mod) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void inc(long long &a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
void dec(long long &a, long long b) {
  a -= b;
  if (a < 0) a += MOD;
}
int mul(int a, int b) {
  long long c = 1ll * a * b;
  return c - c / MOD * MOD;
}
int n, m, d, a[MAXN], c[25];
bool band[(1 << 20) + 5];
void init() {
  for (int i = 1; i < n + 1; i++) {
    if (i > d) c[a[i - d]]--;
    c[a[i]]++;
    if (i >= d) {
      int sta = 0;
      for (int j = 0; j < m; j++) {
        if (!c[j]) sta |= (1 << j);
      }
      band[sta] = true;
    }
  }
}
void work() {
  int ans = m;
  for (int i = (1 << m) - 1; i >= 1; i--) {
    if (band[i]) {
      for (int j = 0; j < m; j++) {
        if (i & (1 << j)) band[i ^ (1 << j)] = true;
      }
    } else {
      ans = min(ans, __builtin_popcount(i));
    }
  }
  printf("%d\n", ans);
}
int main() {
  scanf("%d%d%d", &n, &m, &d);
  int x, y;
  for (int i = 0; i < m; i++) {
    scanf("%d", &x);
    for (int j = 0; j < x; j++) {
      scanf("%d", &y);
      a[y] = i;
    }
  }
  init();
  work();
}
