#include <bits/stdc++.h>
using namespace std;
const int N = 4500;
const int M = 6500;
const int inf = 0x3f3f3f3f;
struct Edge {
  int u, v, f, nxt;
} e[M << 1];
int s, t, cnt, head[N], level[N];
queue<int> q;
int n1, n2, m, d[N], id[N], minDegree = inf;
vector<int> ans[M];
void add(int u, int v, int f) {
  e[cnt].u = u;
  e[cnt].v = v;
  e[cnt].f = f;
  e[cnt].nxt = head[u];
  head[u] = cnt++;
  e[cnt].u = v;
  e[cnt].v = u;
  e[cnt].f = 0;
  e[cnt].nxt = head[v];
  head[v] = cnt++;
}
bool bfs() {
  memset(level, -1, sizeof(level));
  level[s] = 0;
  q.push(s);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = head[u]; i != -1; i = e[i].nxt) {
      int v = e[i].v;
      if (e[i].f > 0 && level[v] < 0) {
        level[v] = level[u] + 1;
        q.push(v);
      }
    }
  }
  return level[t] > 0;
}
int dfs(int u, int mx) {
  if (u == t || !mx) return mx;
  int tmp, res = 0;
  for (int i = head[u]; i != -1 && mx; i = e[i].nxt) {
    int v = e[i].v;
    if (level[v] == level[u] + 1 && (tmp = dfs(v, min(mx, e[i].f)))) {
      e[i].f -= tmp;
      e[i ^ 1].f += tmp;
      res += tmp;
      mx -= tmp;
    }
  }
  if (!res) level[u] = -1;
  return res;
}
int dinic() {
  int maxflow = 0;
  while (bfs()) {
    maxflow += dfs(s, inf);
  }
  return maxflow;
}
int main() {
  memset(head, -1, sizeof(head));
  cnt = 0;
  scanf("%d%d%d", &n1, &n2, &m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, n1 + y, 1);
    d[x]++;
    d[n1 + y]++;
    id[i] = cnt - 1;
  }
  for (int i = 1; i <= n1 + n2; i++) minDegree = min(minDegree, d[i]);
  s = 0;
  t = n1 + n2 + 1;
  for (int i = 1; i <= n1; i++) add(s, i, d[i] - minDegree);
  for (int i = 1; i <= n2; i++) add(n1 + i, t, d[n1 + i] - minDegree);
  for (int k = minDegree; k >= 0; k--) {
    dinic();
    for (int i = 1; i <= m; i++)
      if (e[id[i]].f == 0) ans[k].push_back(i);
    for (int i = head[s]; i != -1; i = e[i].nxt) e[i].f++;
    for (int i = head[t]; i != -1; i = e[i].nxt) e[i ^ 1].f++;
  }
  for (int k = 0; k <= minDegree; k++) {
    printf("%d ", ans[k].size());
    for (int i = 0; i < ans[k].size(); i++) printf("%d ", ans[k][i]);
    puts("");
  }
  return 0;
}
