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;
int n, tot = 1, m, tofa[200005], s[200005], tr[200005], f[200005], dep[200005],
       vis[100005], head[200005], go[200005], nex[200005];
vector<int> ans;
void add(int u, int v) {
  nex[++tot] = head[u];
  head[u] = tot;
  go[tot] = v;
}
void build(int u, int fa, int dp) {
  dep[u] = dep[fa] + 1;
  vis[u] = 1;
  f[u] = fa;
  for (int i = head[u]; i; i = nex[i]) {
    int v = go[i];
    if (v == fa || vis[v]) continue;
    tofa[v] = i;
    tr[i >> 1] = 1;
    build(v, u, dp + 1);
  }
}
void dfs(int u, int fa) {
  vis[u] = 1;
  for (int i = head[u]; i; i = nex[i]) {
    int v = go[i];
    if (v == fa || vis[v]) continue;
    dfs(v, u);
    s[u] += s[v];
  }
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add(u, v);
    add(v, u);
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) build(i, 0, 0);
  }
  for (int i = 1; i <= m; i++) {
    if (!tr[i]) {
      int u = go[i * 2], v = go[i * 2 + 1];
      if (dep[u] < dep[v]) swap(u, v);
      s[u]++;
      s[v]--;
    }
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i, 0);
    }
  }
  for (int i = 1; i <= m; i++) {
    if (tr[i]) continue;
    int u = go[i * 2], v = go[i * 2 + 1];
    if (dep[u] < dep[v]) swap(u, v);
    int tmp = u, bj = 0;
    while (1) {
      if (tmp == v) break;
      if (s[tmp] != 1) {
        bj = 1;
        break;
      }
      tmp = f[tmp];
    }
    if (bj == 0) {
      ans.push_back(i);
      while (1) {
        ans.push_back(tofa[u] >> 1);
        u = f[u];
        if (v == u) break;
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
