Problem: Harry Potter lost his Invisibility Cloak, running from the school caretaker Filch. Finding an invisible object is not an easy task. Fortunately, Harry has friends who are willing to help. Hermione Granger had read "The Invisibility Cloaks, and Everything about Them", as well as six volumes of "The Encyclopedia of Quick Search of Shortest Paths in Graphs, Network Flows, the Maximal Increasing Subsequences and Other Magical Objects". She has already developed a search algorithm for the invisibility cloak in complex dynamic systems (Hogwarts is one of them).

Hogwarts consists of n floors, numbered by integers from 1 to n. Some pairs of floors are connected by staircases. The staircases may change its position, moving exactly one end. Formally the situation is like this: if a staircase connects the floors a and b, then in one move it may modify its position so as to connect the floors a and c or b and c, where c is any floor different from a and b. Under no circumstances the staircase can connect a floor with itself. At the same time there can be multiple stairs between a pair of floors.

Initially, Harry is on the floor with the number 1. He does not remember on what floor he has lost the cloak and wants to look for it on each of the floors. Therefore, his goal is to visit each of n floors at least once. Harry can visit the floors in any order and finish the searching at any floor.

Nowadays the staircases move quite rarely. However, Ron and Hermione are willing to put a spell on any of them to help Harry find the cloak. To cause less suspicion, the three friends plan to move the staircases one by one, and no more than once for each staircase. In between shifting the staircases Harry will be able to move about the floors, reachable at the moment from the staircases, and look for his Invisibility Cloak. It is assumed that during all this time the staircases will not move spontaneously.

Help the three friends to compose a searching plan. If there are several variants to solve the problem, any valid option (not necessarily the optimal one) will be accepted.

Input

The first line contains integers n and m (1 ≤ n ≤ 100000, 0 ≤ m ≤ 200000), which are the number of floors and staircases in Hogwarts, respectively. The following m lines contain pairs of floors connected by staircases at the initial moment of time.

Output

In the first line print "YES" (without the quotes) if Harry is able to search all the floors, and "NO" otherwise. If the answer is positive, then print on the second line the number of staircases that Ron and Hermione will have to shift. Further output should look like this:

Harry's moves

a staircase's move

Harry's moves

a staircase's move

...

a staircase's move

Harry's moves

Each "Harry's move" should be represented as a list of floors in the order in which they have been visited. The total amount of elements of these lists must not exceed 106. When you print each list, first print the number of elements in it, and then in the same line print the actual space-separated elements. The first number in the first list should be the number 1 (the floor, from which Harry begins to search). Any list except the first one might contain the zero number of elements. Note that Harry can visit some floors again, but must visit all n floors at least once. Two consecutively visited floors must be directly connected by a staircase (at the time Harry goes from one of them to the other one). No two floors that are visited consequtively can be equal.

In the description of a "staircase's move" indicate the number of staircase (the staircases are numbered from 1 to m in the order in which they are given in the input data) and its new location (two numbers of the connected floors in any order).

Any staircase can be moved at most once. If there are several solutions, output any.

Examples

Input

6 4
1 2
1 3
2 3
4 5


Output

YES
2
3 1 2 3
2 3 5
3 5 4 5
4 5 6
3 6 5 3


Input

4 1
1 2


Output

NO


Input

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


Output

YES
0
6 1 2 1 3 4 5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct S {
  int ind;
  bool staircase;
  S(int ind, bool staircase) : ind(ind), staircase(staircase) {}
  S() {}
};
int n, m;
vector<pair<int, int> > g[100000];
bool can[100000] = {};
int vis[100000] = {};
int ind = 0;
bool flag = false;
int sind[200000], sfrom[200000], sto[200000], sc = 0;
vector<S> ans;
void mark(int v) {
  can[v] = true;
  for (pair<int, int> to : g[v])
    if (!can[to.first]) {
      mark(to.first);
    }
}
int findUnmarked() {
  while (ind < n && (can[ind] || (!flag && g[ind].empty()))) ++ind;
  if (ind == n && !flag) {
    flag = true;
    ind = 0;
    return findUnmarked();
  }
  return ind;
}
void dfs(int v) {
  ans.push_back(S(v, false));
  vis[v] = 1;
  for (pair<int, int> to : g[v]) {
    if (vis[to.first] == 0) {
      dfs(to.first);
      ans.push_back(S(v, false));
    }
    if (vis[to.first] == 2) {
      int cur = findUnmarked();
      if (cur != n) {
        sind[sc] = to.second;
        sfrom[sc] = v;
        sto[sc] = cur;
        ans.push_back(S(sc++, true));
        mark(cur);
        dfs(cur);
        ans.push_back(S(v, false));
      }
    }
  }
  vis[v] = 2;
}
int tin[100000], fup[100000], timer = 0;
int bestInd = -1, bestFrom, bestTo;
void dfs2(int v, int p) {
  tin[v] = fup[v] = timer++;
  for (pair<int, int> to : g[v])
    if (to.second != p) {
      if (tin[to.first] == -1) {
        dfs2(to.first, to.second);
        if (fup[to.first] < tin[to.first] && bestInd == -1) {
          bestInd = to.second;
          bestFrom = v;
          bestTo = to.first;
        }
        fup[v] = min(tin[v], fup[to.first]);
      } else {
        if (bestInd == -1) {
          bestInd = to.second;
          bestFrom = v;
          bestTo = to.first;
        }
        fup[v] = min(tin[v], tin[to.first]);
      }
    }
}
int main() {
  scanf("%d%d", &n, &m);
  if (n == 1) {
    printf("YES\n0\n1 1\n");
    return 0;
  }
  for (int i = 0; i < (int)(m); ++i) {
    int from, to;
    scanf("%d%d", &from, &to), --from, --to;
    g[from].push_back(make_pair(to, i));
    g[to].push_back(make_pair(from, i));
  }
  int st = 0;
  if (g[0].empty()) {
    for (int i = 0; i < (int)(n); ++i) tin[i] = -1;
    for (int i = 0; i < (int)(n); ++i)
      if (tin[i] == -1 && bestInd == -1) {
        dfs2(i, -1);
      }
    if (bestInd == -1) {
      for (int i = 0; i < (int)(n); ++i)
        if ((int)g[i].size() > 1) {
          bestInd = g[i][0].second;
          bestFrom = i;
          bestTo = g[i][0].first;
          break;
        }
    }
    if (bestInd == -1) {
      printf("NO\n");
      return 0;
    }
    g[bestFrom].erase(find(g[bestFrom].begin(), g[bestFrom].end(),
                           make_pair(bestTo, bestInd)));
    g[bestTo].erase(
        find(g[bestTo].begin(), g[bestTo].end(), make_pair(bestFrom, bestInd)));
    st = bestFrom;
    ans.push_back(S(0, false));
    sind[0] = bestInd;
    sfrom[0] = bestFrom;
    sto[0] = 0;
    ans.push_back(S(0, true));
    ++sc;
    vis[0] = can[0] = true;
  }
  mark(st);
  dfs(st);
  for (int i = 0; i < (int)(n); ++i)
    if (!vis[i]) {
      printf("NO\n");
      return 0;
    }
  printf("YES\n");
  int cnt = 0;
  for (S x : ans)
    if (x.staircase) ++cnt;
  printf("%d\n", cnt);
  for (int beg = 0; beg < (int)ans.size();) {
    if (ans[beg].staircase) {
      int ind = ans[beg].ind;
      printf("%d %d %d\n", sind[ind] + 1, sfrom[ind] + 1, sto[ind] + 1);
      ++beg;
    } else {
      int end = beg + 1;
      while (end < (int)ans.size() && !ans[end].staircase) ++end;
      printf("%d", end - beg);
      for (int i = beg; i < end; ++i) {
        printf(" %d", ans[i].ind + 1);
      }
      printf("\n");
      beg = end;
    }
  }
  return 0;
}