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 = 1e5 + 10;
const int M = 1e5 + 10;
int n, m;
int dfs_clock, ecnt;
int head[N];
int low[N];
int dfn[N];
int vis[N];
int ans[N];
struct Edge {
  int to, next, ind;
} e[M << 1];
inline void adde(int x, int y, int z) {
  e[++ecnt].to = y;
  e[ecnt].next = head[x];
  head[x] = ecnt;
  e[ecnt].ind = z;
}
stack<int> S, E;
void tarjan(int x) {
  dfn[x] = low[x] = ++dfs_clock;
  S.push(x);
  for (int i = head[x]; i; i = e[i].next) {
    int v = e[i].to;
    int cur = E.size();
    if (!vis[e[i].ind]) {
      vis[e[i].ind] = 1;
      E.push(e[i].ind);
    }
    if (!dfn[v]) {
      tarjan(v);
      low[x] = min(low[v], low[x]);
      if (low[v] >= dfn[x]) {
        int sum = 1;
        int z;
        do {
          z = S.top();
          S.pop();
          sum++;
        } while (z != v);
        int ok = (sum == (E.size() - cur));
        while (E.size() > cur) {
          ans[E.top()] = ok;
          E.pop();
        }
      }
    } else
      low[x] = min(low[x], dfn[v]);
  }
  return;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; ++i) {
    int la, lb;
    scanf("%d %d", &la, &lb);
    adde(la, lb, i);
    adde(lb, la, i);
  }
  for (int i = 1; i <= n; ++i) {
    if (!dfn[i]) {
      tarjan(i);
    }
  }
  cout << accumulate(ans + 1, ans + 1 + m, 0) << endl;
  for (int i = 1; i <= m; ++i) {
    if (ans[i]) cout << i << " ";
  }
  return 0;
}
