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 = 1e5 + 10;
const long long mod = 1e9 + 7;
const long long inf = 1e18 + 10;
int mark[N], h[N], f[N], g[N], ps[N], res[N];
vector<pair<int, int> > adj[N];
void dfs0(int v) {
  mark[v] = 1;
  for (pair<int, int> e : adj[v]) {
    int u = e.first;
    if (!mark[u])
      h[u] = h[v] + 1, dfs0(u);
    else if (h[v] < h[u])
      f[u]++, f[v]--;
  }
}
void dfs1(int v) {
  mark[v] = 1;
  for (pair<int, int> e : adj[v])
    if (!mark[e.first]) dfs1(e.first), f[v] += f[e.first];
}
void dfs2(int v) {
  mark[v] = 1;
  ps[v] += (2 <= f[v]);
  for (pair<int, int> e : adj[v])
    if (!mark[e.first]) ps[e.first] = ps[v], dfs2(e.first);
}
void dfs3(int v) {
  mark[v] = 1;
  for (pair<int, int> e : adj[v]) {
    int u = e.first;
    if (!mark[u])
      dfs3(u);
    else if (h[v] < h[u] && 1 <= ps[u] - ps[v])
      g[u]++, g[v]--;
  }
}
void dfs4(int v) {
  mark[v] = 1;
  for (pair<int, int> e : adj[v])
    if (!mark[e.first]) dfs4(e.first), g[v] += g[e.first];
}
void dfs5(int v) {
  mark[v] = 1;
  for (pair<int, int> e : adj[v]) {
    int u = e.first, id = e.second;
    if (!mark[u])
      dfs5(u), res[id] = (f[u] == 1 && g[u] == 0);
    else if (h[v] < h[u])
      res[id] = (f[u] == 1 && g[u] == 0);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(make_pair(v, i));
    adj[v].push_back(make_pair(u, i));
  }
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs0(i);
  memset(mark, 0, sizeof mark);
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs1(i);
  memset(mark, 0, sizeof mark);
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs2(i);
  memset(mark, 0, sizeof mark);
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs3(i);
  memset(mark, 0, sizeof mark);
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs4(i);
  memset(mark, 0, sizeof mark);
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs5(i);
  int cnt = 0;
  for (int i = 1; i <= m; i++)
    if (res[i]) cnt++;
  cout << cnt << '\n';
  for (int i = 1; i <= m; i++)
    if (res[i]) cout << i << ' ';
  return 0;
}
