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;
using ll = long long;
using ld = long double;
const int MAXN = 1e6 + 5, inf = 1e9;
const ll INF = 1e18;
const ld PI = 3.1415926535897932384626433832795;
int BC[MAXN], sz[MAXN], low[MAXN], pre[MAXN], num = 1, tim;
bool vis[MAXN], used[MAXN];
pair<int, int> E[MAXN];
vector<pair<int, int>> G[MAXN];
stack<int> St;
set<int> S[MAXN];
void dfs(int v, int p) {
  vis[v] = 1, pre[v] = tim++, low[v] = pre[v];
  for (auto e : G[v]) {
    int u = e.first, id = e.second;
    if (u == p) continue;
    if (!used[id]) {
      St.push(id);
      used[id] = 1;
    }
    if (!vis[u]) {
      dfs(u, v);
      low[v] = min(low[v], low[u]);
      if (low[u] >= pre[v]) {
        int x = St.top();
        while (x != id) {
          BC[x] = num;
          St.pop();
          x = St.top();
        }
        BC[x] = num++;
        St.pop();
      }
    } else
      low[v] = min(low[v], pre[u]);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << setprecision(13) << fixed;
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    G[a].push_back({b, i});
    G[b].push_back({a, i});
    E[i] = {a, b};
  }
  for (int i = 1; i <= n; i++) {
    if (!low[i]) dfs(i, i);
  }
  for (int i = 0; i < m; i++) {
    sz[BC[i]]++;
    S[BC[i]].insert({E[i].first});
    S[BC[i]].insert({E[i].second});
  }
  for (int i = 1; i < num; i++) {
    if (S[i].size() == sz[i]) {
      S[0].insert(i);
    }
  }
  vector<int> res;
  for (int i = 0; i < m; i++) {
    if (S[0].find(BC[i]) == S[0].end()) continue;
    res.push_back(i + 1);
  }
  cout << res.size() << "\n";
  for (int i : res) cout << i << " ";
  cout << "\n";
}
