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 maxn = 1e5 + 10;
const int maxm = 2e6 + 10;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * f;
}
int cnt, head[maxn], n, m;
struct edge {
  int v, next, id;
} edge[maxm << 1];
void add(int u, int v, int id) {
  edge[cnt].v = v;
  edge[cnt].id = id;
  edge[cnt].next = head[u];
  head[u] = cnt++;
}
set<int> ans;
pair<int, int> stk[maxm];
int low[maxn], dfn[maxn];
int top, tim, cntbrg, dccnum, rt, dsize[maxn], brg[maxn];
vector<int> dcc[maxn];
bool cut[maxn], vis[maxm << 1];
void init() {
  cntbrg = dccnum = tim = top = 0;
  for (int i = 1; i <= n; i++) {
    head[i] = -1;
    dfn[i] = low[i] = 0;
  }
}
void tarjan(int u, int pre) {
  dfn[u] = low[u] = ++tim;
  if (rt == u && head[u] == -1) {
    dcc[++dccnum].clear();
    dcc[dccnum].push_back(u);
    return;
  }
  int cntzs = 0;
  for (int i = head[u]; i != -1; i = edge[i].next) {
    int v = edge[i].v, id = edge[i].id;
    if (vis[id]) continue;
    vis[id] = 1;
    stk[++top] = make_pair(v, id);
    if (!dfn[v]) {
      tarjan(v, u);
      low[u] = min(low[u], low[v]);
      if (low[v] >= dfn[u]) {
        if (rt == u && cntzs > 1 || u != rt) cut[u] = 1;
        dcc[++dccnum].clear();
        pair<int, int> w;
        do {
          w = stk[top--];
          if (brg[w.first] != dccnum) {
            dsize[dccnum]++;
            brg[w.first] = dccnum;
          }
          dcc[dccnum].push_back(w.second);
        } while (w.second != id);
        if (dsize[dccnum] > 1 && dcc[dccnum].size() == dsize[dccnum]) {
          for (int j = 0; j < dsize[dccnum]; j++) ans.insert(dcc[dccnum][j]);
        }
      }
    } else if (v != pre)
      low[u] = min(low[u], dfn[v]);
  }
}
int main() {
  n = read(), m = read();
  init();
  for (int i = 1; i <= m; i++) {
    int u = read(), v = read();
    add(u, v, i);
    add(v, u, i);
  }
  for (int i = 1; i <= n; i++) {
    if (!dfn[i]) tarjan(i, i);
  }
  printf("%d\n", ans.size());
  for (auto it = ans.begin(); it != ans.end();) {
    printf("%d ", *it++);
  }
  puts("");
}
