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 = 400000;
int low[N], idx[N], dfs;
vector<vector<pair<int, int> > > g;
int n, e;
set<pair<int, int> > rem;
bool br[N];
void DFS(int u, int p) {
  low[u] = idx[u] = ++dfs;
  vector<pair<int, int> > seg;
  for (auto vv : g[u]) {
    auto v = vv.first;
    if (!idx[v]) {
      int l = dfs + 1;
      DFS(v, u);
      int r = dfs;
      low[u] = min(low[u], low[v]);
      if (low[v] >= idx[u]) seg.push_back({l, r});
      if (low[v] > idx[u]) br[vv.second] = true;
    } else if (v != p)
      low[u] = min(low[u], idx[v]);
  }
  if (seg.empty()) return;
  int before = g.size();
  g.resize(g.size() + seg.size());
  for (int i = 0; i < g[u].size(); ++i) {
    int v = g[u][i].first;
    if (idx[v] >= seg[0].first && low[v] >= idx[u]) {
      auto it = upper_bound(seg.begin(), seg.end(), make_pair(idx[v], N)) -
                seg.begin();
      --it;
      if (idx[v] > seg[it].second) continue;
      int w = it + before;
      g[w].push_back(make_pair(v, g[u][i].second));
      g[v].push_back(make_pair(w, g[u][i].second));
      rem.insert({min(u, v), max(u, v)});
    }
  }
}
bool vis[N];
int cnt;
set<int> E;
void DFS(int u) {
  vis[u] = true;
  ++cnt;
  for (auto vv : g[u]) {
    auto v = vv.first;
    E.insert(vv.second);
    if (!vis[v]) DFS(v);
  }
}
int main() {
  scanf("%d%d", &n, &e);
  g.resize(n);
  g.reserve(2 * n);
  for (int i = 0, a, b; i < e; ++i) {
    scanf("%d%d", &a, &b);
    --a;
    --b;
    g[a].push_back({b, i});
    swap(a, b);
    g[a].push_back({b, i});
  }
  for (int i = 0; i < n; ++i)
    if (!low[i]) DFS(i, -1);
  for (int i = 0; i < g.size(); ++i) {
    for (int j = 0; j < g[i].size(); ++j) {
      int u = i;
      int v = g[i][j].first;
      if (u > v) swap(u, v);
      if (br[g[i][j].second] || rem.find(make_pair(u, v)) != rem.end()) {
        g[i][j] = g[i].back();
        g[i].pop_back();
        --j;
      }
    }
  }
  set<int> sol;
  for (int i = 0; i < g.size(); ++i)
    if (!vis[i]) {
      E.clear();
      cnt = 0;
      DFS(i);
      if (E.size() == cnt) {
        for (auto x : E) sol.insert(x);
      }
    }
  printf("%d\n", (int)sol.size());
  for (auto x : sol) printf("%d ", x + 1);
  return 0;
}
