2 0
 100000 0
 8 9
1 2
2 3
3 4
4 1
5 6
6 7
7 8
8 5
6 8
 2 1
1 2
 11 9
5 9
8 5
11 3
11 1
3 4
7 11
3 1
11 2
7 2
 7 9
7 3
7 4
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 7 5
5 4
7 3
7 1
6 7
3 1
 7 8
1 2
2 3
3 4
4 1
3 5
5 6
6 7
7 3
 6 9
1 2
2 3
1 4
4 2
5 2
5 3
4 5
6 4
6 5
 7 9
1 2
2 4
4 3
3 1
2 3
4 5
5 6
6 7
7 4
 1 0
 6 7
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 4 5
1 2
2 3
3 4
4 1
1 3
 100000 3
99998 99999
99999 100000
100000 99998

0

 0

 4
1 2 3 4 
 0

 6
3 4 6 7 8 9 
 9
1 2 3 4 5 6 7 8 9 
 3
2 3 5 
 8
1 2 3 4 5 6 7 8 
 0

 4
6 7 8 9 
 0

 6
1 2 3 5 6 7 
 0

 3
1 2 3 

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int M = N << 1 | 1;
char O[1 << 14], *S = O, *T = O;
inline int read() {
  int x = 0, f = 1;
  char ch =
      (S == T && (T = (S = O) + fread(O, 1, 1 << 14, stdin), S == T) ? -1
                                                                     : *S++);
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = (S == T && (T = (S = O) + fread(O, 1, 1 << 14, stdin), S == T) ? -1
                                                                        : *S++);
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = (S == T && (T = (S = O) + fread(O, 1, 1 << 14, stdin), S == T) ? -1
                                                                        : *S++);
  }
  return x * f;
}
struct edge {
  int y, nxt;
} e[M];
int li[N];
inline void add(int u, int v) {
  static int top = 0;
  e[++top] = (edge){v, li[u]};
  li[u] = top;
  e[++top] = (edge){u, li[v]};
  li[v] = top;
}
int dfn[N], low[N], clk, bccno[N], bcccnt, top, stk[M];
int ck[M], ans[M], ckt, anst;
void dfs(int u, int fa) {
  dfn[u] = low[u] = ++clk;
  for (int t = li[u]; t; t = e[t].nxt) {
    int v = e[t].y;
    if (v == fa) continue;
    if (!dfn[v]) {
      stk[top++] = t;
      dfs(v, u);
      low[u] = min(low[v], low[u]);
      if (low[v] >= dfn[u]) {
        bcccnt++;
        bool ok = 1;
        ckt = 0;
        while (1) {
          int x = stk[--top];
          ck[ckt++] = ((x + 1) >> 1);
          if (bccno[e[x].y] != bcccnt)
            bccno[e[x].y] = bcccnt;
          else
            ok = 0;
          if (x == t) break;
        }
        if (ok && ckt > 1)
          for (int i = 0; i < ckt; ++i) ans[anst++] = ck[i];
      }
    } else if (dfn[v] < dfn[u]) {
      low[u] = min(dfn[v], low[u]);
      stk[top++] = t;
    }
  }
}
int main() {
  int n = read(), m = read();
  for (int i = 0; i < m; ++i) {
    int u = read(), v = read();
    add(u, v);
  }
  for (int i = 1; i <= n; ++i)
    if (!dfn[i]) dfs(i, -1);
  sort(ans, ans + anst);
  printf("%d\n", anst);
  for (int i = 0; i < anst; ++i) printf("%d ", ans[i]);
  return 0 * putchar(10);
}
