#include <bits/stdc++.h>
using namespace std;
struct data {
  int v, w, nxt;
} e[2000010];
int head[200010];
int cnt;
void add(int u, int v, int w) {
  e[++cnt].v = v;
  e[cnt].w = w;
  e[cnt].nxt = head[u];
  head[u] = cnt;
}
inline void ad(int u, int v, int w) {
  add(u, v, w);
  add(v, u, 0);
}
int n1, n2, m, k = 2e9;
int dis[200010];
int cur[200010];
queue<int> q;
int s, t;
void init() { cnt = -1, memset(head, -1, sizeof(head)); }
int bfs() {
  for (int i = s; i <= t; i++) dis[i] = -1, cur[i] = head[i];
  while (!q.empty()) q.pop();
  dis[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 (dis[v] == -1 && e[i].w) {
        dis[v] = dis[u] + 1;
        q.push(v);
      }
    }
  }
  return dis[t] != -1;
}
int dfs(int u, int exp) {
  if (u == t) return exp;
  int flow = 0, tmp = 0;
  for (int i = cur[u]; i != -1; i = e[i].nxt) {
    cur[u] = i;
    int v = e[i].v;
    if (dis[v] == dis[u] + 1 && e[i].w) {
      tmp = dfs(v, min(exp, e[i].w));
      if (!tmp) continue;
      exp -= tmp;
      flow += tmp;
      e[i].w -= tmp;
      e[i ^ 1].w += tmp;
      if (!exp) break;
    }
  }
  return flow;
}
void calc() {
  while (bfs()) dfs(s, 0x7fffffff);
}
vector<int> ans[2010];
int id[100010];
int d[100010];
int main() {
  init();
  int x, y;
  scanf("%d%d%d", &n1, &n2, &m);
  s = 0, t = n1 + n2 + 1;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    ad(x, n1 + y, 1);
    id[i] = cnt;
    d[x]++, d[n1 + y]++;
  }
  for (int i = 1; i <= n1 + n2; i++) k = min(k, d[i]);
  for (int i = 1; i <= n1; i++) ad(s, i, d[i] - k);
  for (int i = n1 + 1; i <= n1 + n2; i++) ad(i, t, d[i] - k);
  for (int i = k; i >= 0; i--) {
    calc();
    for (int j = 1; j <= m; j++)
      if (e[id[j]].w == 0) ans[i].push_back(j);
    for (int j = head[s]; j != -1; j = e[j].nxt) e[j].w++;
    for (int j = head[t]; j != -1; j = e[j].nxt) e[j ^ 1].w++;
  }
  for (int i = 0; i <= k; i++) {
    printf("%d ", ans[i].size());
    for (int j = 0; j < ans[i].size(); j++) printf("%d ", ans[i][j]);
    printf("\n");
  }
}
