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 mx = 2e5 + 5;
inline int read() {
  int X = 0;
  bool flag = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') flag = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    X = (X << 1) + (X << 3) + ch - '0';
    ch = getchar();
  }
  if (flag) return X;
  return ~(X - 1);
}
struct block {
  int u, v, idx;
};
int n, m;
int head[mx], nxt[mx], ver[mx], id[mx], tot;
int ans[mx], f[mx], g[mx];
int pos[mx], dep[mx];
int vis[mx], fa[mx], son[mx];
int topo[mx], cnt;
vector<block> query;
void add(int x, int y, int z) {
  ver[++tot] = y, id[tot] = z, nxt[tot] = head[x], head[x] = tot;
}
void tarjan(int x, int fath) {
  vis[x] = 1;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (y == fath) continue;
    if (!vis[y]) {
      fa[y] = x, son[x] = y, dep[y] = dep[x] + 1, pos[y] = id[i], tarjan(y, x);
    } else if (dep[y] < dep[x]) {
      query.push_back((block){x, y, id[i]});
      f[x]++, f[y]--;
    }
  }
  topo[++cnt] = x;
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    add(x, y, i), add(y, x, i);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      cnt = 0, query.clear();
      tarjan(i, 0);
      for (int j = 1; j <= cnt; j++) {
        int x = topo[j];
        f[fa[x]] += f[x];
      }
      for (int j = 0; j < query.size(); j++) {
        int u = query[j].u, v = query[j].v, idx = query[j].idx, tmp = u;
        while (tmp != v && f[tmp] == 1) tmp = fa[tmp];
        if (tmp == v) g[u]++, g[v]--, ans[idx] = 1;
      }
      for (int j = 1; j <= cnt; j++) {
        int x = topo[j];
        g[fa[x]] += g[x];
      }
      for (int j = 1; j <= cnt; j++) {
        int x = topo[j];
        if (x == i) continue;
        if (g[x] == 1) ans[pos[x]] = 1;
      }
    }
  int res = 0;
  for (int i = 1; i <= m; i++)
    if (ans[i]) res++;
  printf("%d\n", res);
  for (int i = 1; i <= m; i++)
    if (ans[i]) printf("%d ", i);
}
