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 = (int)1e5 + 7;
int n, m;
vector<pair<int, int> > G[N];
vector<int> ans;
int dfn[N], low[N], dfs_clock;
int stk[N], top, estk[N], etop;
void tarjan(int u, int eid) {
  dfn[u] = low[u] = ++dfs_clock;
  stk[++top] = u;
  for (auto &e : G[u]) {
    int v = e.second, id = e.first;
    if (id == eid) continue;
    if (!dfn[v]) {
      estk[++etop] = id;
      tarjan(v, id);
      low[u] = min(low[u], low[v]);
      if (low[v] >= dfn[u]) {
        int pcnt = 0, ecnt = 0;
        while (1) {
          int t = stk[top--];
          pcnt++;
          if (t == v) break;
        }
        pcnt++;
        while (1) {
          int t = estk[etop--];
          ans.push_back(t);
          ecnt++;
          if (t == id) break;
        }
        if (pcnt == 1 || pcnt != ecnt) {
          while (ecnt--) ans.pop_back();
        }
      }
    } else if (dfn[v] < dfn[u]) {
      estk[++etop] = id;
      low[u] = min(low[u], dfn[v]);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(make_pair(i, v));
    G[v].push_back(make_pair(i, u));
  }
  for (int i = 1; i <= n; i++) {
    if (!dfn[i]) {
      tarjan(i, 0);
    }
  }
  sort(ans.begin(), ans.end());
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < ans.size(); i++) {
    printf("%d%c", ans[i], " \n"[i == (int)ans.size() - 1]);
  }
  return 0;
}
