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 T;
const int N = 110000;
int a[N], b[N], vis[N], cnt[N], cnt1[N], p[N];
vector<int> V, adj[N], con[N];
void dfs(int u, int pe) {
  vis[u] = ++T;
  for (int e : adj[u]) {
    if (e == pe) continue;
    int v = a[e] ^ b[e] ^ u;
    if (!vis[v]) {
      con[u].push_back(v);
      p[v] = e;
      dfs(v, e);
    } else if (vis[v] < vis[u]) {
      V.push_back(e);
      if (a[e] == v) swap(a[e], b[e]);
      cnt[u]++;
      cnt[v]--;
    }
  }
}
void dfs1(int u) {
  vis[u] = 1;
  for (int v : con[u]) {
    dfs1(v);
    cnt[u] += cnt[v];
  }
  cnt1[u] = cnt[u] >= 2;
}
void dfs2(int u) {
  vis[u] = 1;
  for (int v : con[u]) {
    cnt1[v] += cnt1[u];
    dfs2(v);
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++)
    scanf("%d%d", &a[i], &b[i]), adj[a[i]].push_back(i), adj[b[i]].push_back(i);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, 0);
  memset(vis, 0, sizeof vis);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs1(i);
  memset(vis, 0, sizeof vis);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs2(i);
  vector<int> ans;
  for (int e : V)
    if (cnt1[a[e]] == cnt1[b[e]]) {
      ans.push_back(e);
      int u = a[e], v = b[e];
      while (u != v) {
        ans.push_back(p[u]);
        int f = p[u];
        u ^= a[f] ^ b[f];
      }
    }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (int e : ans) printf("%d ", e);
  return 0;
}
