#include <bits/stdc++.h>
using namespace std;
const int N = 4e3 + 5, inf = 1e9;
vector<int> ans[N];
int n1, n2, mn = inf, m, s, t;
struct yal {
  int to, flow, C, ind, rev;
};
vector<yal> adj[N];
struct FreeRun {
  int CNT[N], H[N], q[N], l, r;
  void add(int u, int v, int C, int ind) {
    yal a{v, 0, C, ind, (int)adj[v].size()};
    yal b{u, 0, 0, -ind, (int)adj[u].size()};
    adj[u].push_back(a);
    adj[v].push_back(b);
  }
  bool cork(int s, int t) {
    memset(H, -1, sizeof(H));
    H[s] = l = r = 0;
    q[r++] = s;
    while (l ^ r) {
      int u = q[l++];
      for (yal &y : adj[u]) {
        if (H[y.to] < 0 && y.flow < y.C) {
          H[y.to] = H[u] + 1;
          q[r++] = y.to;
        }
      }
    }
    return (H[t] < 0 ? 0 : 1);
  }
  int wallspin(int flow, int u, int t) {
    if (u == t) return (flow);
    for (; CNT[u] < (int)adj[u].size(); CNT[u]++) {
      yal &y = adj[u][CNT[u]];
      if (!(H[y.to] == H[u] + 1 && y.flow < y.C)) continue;
      int tmp = min(flow, y.C - y.flow);
      int ah = wallspin(tmp, y.to, t);
      if (ah <= 0) continue;
      y.flow += ah;
      adj[y.to][y.rev].flow -= ah;
      return (ah);
    }
    return (0);
  }
  inline int gainer(int s, int t) {
    if (s == t) return (-1);
    int rt = 0;
    while (cork(s, t)) {
      memset(CNT, 0, sizeof(CNT));
      while (int tmp = wallspin(inf, s, t)) rt += tmp;
    }
    return (rt);
  }
} f1;
int main() {
  scanf("%d %d %d", &n1, &n2, &m);
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    f1.add(a, n1 + b, 1, i + 1);
  }
  t = n1 + n2 + 1;
  for (int i = 1; i < t; i++) mn = min(mn, (int)adj[i].size());
  for (int i = 1; i <= n1; i++) f1.add(s, i, (int)adj[i].size() - mn, -1);
  for (int i = n1 + 1; i < t; i++) f1.add(i, t, (int)adj[i].size() - mn, -1);
  for (int i = mn; ~i; i--) {
    f1.gainer(s, t);
    for (int j = 1; j <= n1; j++)
      for (yal y : adj[j])
        if (y.ind > 0 && y.to && !y.flow) ans[i].push_back(y.ind);
    for (int j = 1; j <= n1; j++) f1.add(s, j, 1, -1);
    for (int j = n1 + 1; j < t; j++) f1.add(j, t, 1, -1);
  }
  for (int i = 0; i <= mn; i++) {
    printf("%d ", (int)ans[i].size());
    for (int x : ans[i]) printf("%d ", x);
    puts("");
  }
}
