Once upon a time there lived a good fairy A. One day a fine young man B came to her and asked to predict his future. The fairy looked into her magic ball and said that soon the fine young man will meet the most beautiful princess ever and will marry her. Then she drew on a sheet of paper n points and joined some of them with segments, each of the segments starts in some point and ends in some other point. Having drawn that picture, she asked the young man to erase one of the segments from the sheet. Then she tries to colour each point red or blue so, that there is no segment having points of the same colour as its ends. If she manages to do so, the prediction will come true. B wants to meet the most beautiful princess, that's why he asks you to help him. Find all the segments that will help him to meet the princess.

Input

The first input line contains two integer numbers: n — amount of the drawn points and m — amount of the drawn segments (1 ≤ n ≤ 104, 0 ≤ m ≤ 104). The following m lines contain the descriptions of the segments. Each description contains two different space-separated integer numbers v, u (1 ≤ v ≤ n, 1 ≤ u ≤ n) — indexes of the points, joined by this segment. No segment is met in the description twice.

Output

In the first line output number k — amount of the segments in the answer. In the second line output k space-separated numbers — indexes of these segments in ascending order. Each index should be output only once. Segments are numbered from 1 in the input order.

Examples

Input

4 4
1 2
1 3
2 4
3 4


Output

4
1 2 3 4 

Input

4 5
1 2
2 3
3 4
4 1
1 3


Output

1
5 
#include <bits/stdc++.h>
using namespace std;
struct edge {
  int nxt, t, id;
} e[10010 << 1];
int head[10010], edge_cnt;
void add_edge(int x, int y, int z) {
  e[edge_cnt] = (edge){head[x], y, z};
  head[x] = edge_cnt++;
}
int Cnt, Rec, dep[10010], sum[10010], ID[10010];
vector<int> Ans;
bool vis[10010];
void dfs(int x, int f) {
  vis[x] = 1;
  int i;
  for (i = head[x]; ~i; i = e[i].nxt) {
    int to = e[i].t;
    if (vis[to]) {
      if (to != f && dep[to] < dep[x]) {
        if (((dep[x] - dep[to] + 1) & 1) == 1) {
          sum[x]++;
          sum[to]--;
          Cnt++;
          Rec = e[i].id;
        } else {
          sum[x]--;
          sum[to]++;
        }
      }
    } else {
      ID[to] = e[i].id;
      dep[to] = dep[x] + 1;
      dfs(to, x);
      sum[x] += sum[to];
    }
  }
}
int main() {
  int n, m, i;
  scanf("%d%d", &n, &m);
  memset(head, -1, sizeof(head));
  for (i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add_edge(x, y, i);
    add_edge(y, x, i);
  }
  for (i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i, 0);
    }
  }
  if (Cnt == 0) {
    printf("%d\n", m);
    for (i = 1; i <= m; i++) {
      printf("%d%c", i, " \n"[i == m]);
    }
  } else {
    if (Cnt == 1) {
      Ans.push_back(Rec);
    }
    for (i = 1; i <= n; i++) {
      if (sum[i] == Cnt) {
        Ans.push_back(ID[i]);
      }
    }
    sort(Ans.begin(), Ans.end());
    int t = Ans.size();
    printf("%d\n", t);
    for (i = 0; i < t; i++) {
      printf("%d%c", Ans[i], " \n"[i == t - 1]);
    }
  }
  return 0;
}
