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 MAXN = 200005;
int n, m;
int deg[MAXN];
vector<pair<int, int>> graph[MAXN];
int up[MAXN], visit[MAXN], vtime;
vector<tuple<int, int, int>> stk;
int bcc_cnt;
set<int> bccverts[MAXN];
set<int> bccedges[MAXN];
void dfs(int nod, int par_edge) {
  up[nod] = visit[nod] = ++vtime;
  int child = 0;
  for (const auto& e : graph[nod]) {
    int next = e.first, edge_id = e.second;
    if (edge_id == par_edge) continue;
    if (visit[next] == 0) {
      stk.emplace_back(nod, next, edge_id);
      ++child;
      dfs(next, edge_id);
      if ((par_edge == -1 && child > 1) ||
          (par_edge != -1 && up[next] >= visit[nod])) {
        ++bcc_cnt;
        do {
          int lastnod, lastnext, lasteid;
          tie(lastnod, lastnext, lasteid) = stk.back();
          stk.pop_back();
          bccverts[bcc_cnt].insert(lastnext);
          bccedges[bcc_cnt].insert(lasteid);
          if (lastnod == nod && lastnext == next) break;
        } while (!stk.empty());
        bccverts[bcc_cnt].insert(nod);
      }
      up[nod] = min(up[nod], up[next]);
    } else {
      if (visit[next] <= visit[nod]) {
        stk.emplace_back(nod, next, edge_id);
      }
      up[nod] = min(up[nod], visit[next]);
    }
  }
}
void get_bcc() {
  vtime = 0;
  memset(visit, 0, sizeof(visit));
  bcc_cnt = 0;
  for (int i = 1; i <= n; ++i) {
    if (visit[i] == 0) {
      dfs(i, -1);
      if (!stk.empty()) {
        ++bcc_cnt;
        do {
          int lastnod, lastnext, lasteid;
          tie(lastnod, lastnext, lasteid) = stk.back();
          stk.pop_back();
          bccverts[bcc_cnt].insert(lastnext);
          bccedges[bcc_cnt].insert(lasteid);
        } while (!stk.empty());
        bccverts[bcc_cnt].insert(i);
      }
    }
  }
}
void proc() {
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int a, b;
    cin >> a >> b;
    deg[a] += 1;
    deg[b] += 1;
    graph[a].emplace_back(b, i);
    graph[b].emplace_back(a, i);
  }
  get_bcc();
  vector<int> ans;
  for (int i = 1; i <= bcc_cnt; ++i) {
    if (bccverts[i].size() == bccedges[i].size()) {
      for (int e : bccedges[i]) ans.push_back(e);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (int e : ans) cout << e << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  proc();
  return 0;
}
