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;
struct edge {
  int a, b, i;
} in[2100005];
vector<edge> v[100005];
vector<int> stk;
unordered_set<int> bcc[100005], bccedge[100005];
int vis[100005], low[100005], clk, bccclk;
bitset<2100005> cnt;
void dfs(int x, int p) {
  vis[x] = low[x] = ++clk;
  for (auto i : v[x])
    if (i.b != p) {
      if (!vis[i.b]) {
        stk.push_back(i.i);
        dfs(i.b, x);
        low[x] = min(low[x], low[i.b]);
        if (vis[x] <= low[i.b]) {
          int a = -1;
          while (a != i.i) {
            a = stk.back();
            stk.pop_back();
            bcc[bccclk].insert(in[a].a);
            bcc[bccclk].insert(in[a].b);
            bccedge[bccclk].insert(a);
          }
          bccclk++;
        }
      } else if (vis[x] > vis[i.b]) {
        low[x] = min(low[x], vis[i.b]);
        stk.push_back(i.i);
      }
    }
}
int main() {
  {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
  };
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> in[i].a >> in[i].b;
    in[i].i = i;
    v[in[i].a].push_back({in[i].a, in[i].b, i});
    v[in[i].b].push_back({in[i].b, in[i].a, i});
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, i);
  for (int i = 0; i < bccclk; i++)
    if (bcc[i].size() == bccedge[i].size()) {
      for (int j : bccedge[i]) cnt[j] = 1;
    }
  cout << cnt.count() << '\n';
  for (int i = 1; i <= m; i++)
    if (cnt[i]) cout << i << ' ';
  return 0;
}
