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 v, id;
};
set<int> Ans;
vector<Edge> G[100000 + 5];
int cnt;
stack<int> Node;
bool vis[100000 + 5];
int dfn[100000 + 5], Low[100000 + 5];
void Tarjan(int u, int fa) {
  Node.push(u);
  dfn[u] = Low[u] = ++cnt;
  for (auto e : G[u]) {
    int v = e.v;
    if (!dfn[v]) {
      Tarjan(v, u);
      Low[u] = min(Low[u], Low[v]);
      if (Low[v] >= dfn[u]) {
        set<int> E;
        vector<int> tmp;
        do {
          vis[Node.top()] = 1;
          tmp.push_back(Node.top());
          Node.pop();
        } while (!vis[v]);
        tmp.push_back(u);
        for (int u : tmp)
          for (auto e : G[u])
            if (vis[e.v]) E.insert(e.id);
        if (E.size() == tmp.size()) Ans.insert(E.begin(), E.end());
        for (int i : tmp) vis[i] = 0;
      }
    } else if (v != fa)
      Low[u] = min(Low[u], dfn[v]);
  }
}
int main() {
  int N, M;
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= M; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back({v, i});
    G[v].push_back({u, i});
  }
  for (int i = 1; i <= N; i++)
    if (!dfn[i]) Tarjan(i, -1);
  printf("%d\n", Ans.size());
  for (auto i : Ans) printf("%d ", i);
}
