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 = 2e5 + 7;
struct edge {
  int t, nxt;
} e[N << 1];
int n, m, cnt = 1, T, tp, now, nume, numd;
int head[N], dfn[N], low[N], st[N], vis[N << 1], bl[N], a[N];
vector<int> ans;
void add(int u, int t) {
  e[++cnt].t = t;
  e[cnt].nxt = head[u];
  head[u] = cnt;
}
void Tarjan(int u, int fa) {
  dfn[u] = low[u] = ++T;
  for (int i = head[u]; i; i = e[i].nxt) {
    int t = e[i].t;
    if (t == fa || vis[i]) continue;
    vis[i] = vis[i ^ 1] = 1;
    st[++tp] = i;
    if (!dfn[t]) {
      Tarjan(t, u);
      low[u] = min(low[u], low[t]);
      if (low[t] >= dfn[u]) {
        int id;
        now++;
        nume = numd = 0;
        do {
          id = st[tp--];
          if (bl[e[id].t] != now) bl[e[id].t] = now, numd++;
          if (bl[e[id ^ 1].t] != now) bl[e[id ^ 1].t] = now, numd++;
          a[++nume] = id;
        } while (id != i);
        if (nume == numd)
          for (int i = 1; i <= nume; i++) ans.push_back(a[i] >> 1);
      }
    } else
      low[u] = min(low[u], dfn[t]);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, u, v; i <= m; i++)
    scanf("%d%d", &u, &v), add(u, v), add(v, u);
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) Tarjan(i, 0);
  sort(ans.begin(), ans.end());
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < (int)ans.size(); i++) printf("%d ", ans[i]);
}
