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>
#pragma GCC optimize "-O3"
using namespace std;
const int MAXN = 120000;
int was[MAXN];
vector<pair<int, int>> eds[MAXN];
vector<int> go[MAXN];
int pe[MAXN];
int p[MAXN];
int h[MAXN];
int ad[MAXN];
vector<pair<int, int>> vv;
int cc[MAXN];
int n, m;
int dfs1(int v) {
  int cur = 0;
  was[v] = 1;
  for (auto e : eds[v]) {
    int u = e.first;
    if (was[u]) {
      if (h[u] < h[v] - 1) {
        --ad[u];
        vv.push_back(make_pair(v, u));
        go[v].push_back(e.second);
        ++cur;
      }
    } else {
      h[u] = h[v] + 1;
      p[u] = v;
      pe[u] = e.second;
      cur += dfs1(u);
    }
  }
  cur += ad[v];
  if (h[v] != 0) {
    cc[pe[v]] = cur;
  }
  return cur;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    eds[a].push_back(make_pair(b, i));
    eds[b].push_back(make_pair(a, i));
  }
  for (int i = 0; i < n; ++i)
    if (!was[i]) dfs1(i);
  vector<int> ans;
  for (auto e : vv) {
    int a, b;
    tie(a, b) = e;
    int fl = 0;
    while (a != b) {
      if (cc[pe[a]] != 1) {
        fl = 1;
        break;
      }
      a = p[a];
    }
    if (!fl) {
      tie(a, b) = e;
      ans.push_back(go[a][0]);
      while (a != b) {
        ans.push_back(pe[a]);
        a = p[a];
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << "\n";
  for (int i : ans) cout << i + 1 << " ";
  return 0;
}
