Problem: Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a bad day, and good and bad days are alternating in it. Let us denote bad days as 0 and good days as 1. Then, for example, sequences of days 0, 010, 01010 are zebras, while sequences 1, 0110, 0101 are not.

Oleg tells you the story of days he lived in chronological order in form of string consisting of 0 and 1. Now you are interested if it is possible to divide Oleg's life history into several subsequences, each of which is a zebra, and the way it can be done. Each day must belong to exactly one of the subsequences. For each of the subsequences, days forming it must be ordered chronologically. Note that subsequence does not have to be a group of consecutive days. 

Input

In the only line of input data there is a non-empty string s consisting of characters 0 and 1, which describes the history of Oleg's life. Its length (denoted as |s|) does not exceed 200 000 characters.

Output

If there is a way to divide history into zebra subsequences, in the first line of output you should print an integer k (1 ≤ k ≤ |s|), the resulting number of subsequences. In the i-th of following k lines first print the integer li (1 ≤ li ≤ |s|), which is the length of the i-th subsequence, and then li indices of days forming the subsequence. Indices must follow in ascending order. Days are numbered starting from 1. Each index from 1 to n must belong to exactly one subsequence. If there is no way to divide day history into zebra subsequences, print -1.

Subsequences may be printed in any order. If there are several solutions, you may print any of them. You do not have to minimize nor maximize the value of k.

Examples

Input

0010100


Output

3
3 1 3 4
3 2 5 6
1 7


Input

111


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int belong[N], cnt, len;
bool vis[N];
int BLOCK;
char s[N];
vector<int> ans[N];
struct block {
  bool Has[2];
  int id, l, r;
  int fd(int pat) {
    for (int i = l; i <= r; ++i) {
      if (!vis[i] && s[i] - '0' == pat) return i;
    }
    if (pat == 0)
      Has[0] = false;
    else
      Has[1] = false;
    return -1;
  }
} dat[N];
void init() {
  BLOCK = sqrt(len) + 1;
  cnt = len % BLOCK == 0 ? len / BLOCK : len / BLOCK + 1;
  for (int i = 0; i < cnt; ++i) {
    dat[i].l = i * BLOCK;
    dat[i].r = (i + 1) * BLOCK - 1;
  }
  dat[cnt - 1].r = len - 1;
  for (int i = 0; i < len; ++i) {
    belong[i] = i / BLOCK;
  }
  for (int i = 0; i < len; ++i) {
    dat[belong[i]].Has[s[i] - '0'] = true;
  }
  memset(vis, 0, sizeof(vis));
}
int Find(int pos, int pat) {
  int nowb = belong[pos];
  for (int i = pos; i <= dat[nowb].r; ++i) {
    if (s[i] - '0' == pat && !vis[i]) return i;
  }
  nowb++;
  while (nowb < cnt) {
    if (!dat[nowb].Has[pat]) {
      nowb++;
      continue;
    }
    int res = dat[nowb].fd(pat);
    if (res != -1)
      return res;
    else
      nowb++;
  }
  if (nowb == cnt)
    return -1;
  else {
    for (int i = dat[nowb].l; i <= dat[nowb].r; ++i) {
      if (s[i] - '0' == pat && !vis[i]) return i;
    }
  }
  return -1;
}
void solve() {
  int sum = 0, now = 0;
  while (1) {
    int la = Find(0, 0);
    if (la == -1)
      break;
    else
      sum += 1;
    vis[la] = true;
    ans[now].push_back(la);
    while (1) {
      int p1 = Find(la, 1), p2 = Find(max(p1, 0), 0);
      if (p1 == -1 || p2 == -1) {
        ++now;
        break;
      } else {
        vis[p1] = vis[p2] = true;
        ans[now].push_back(p1);
        ans[now].push_back(p2);
        sum += 2;
        la = p2;
      }
    }
  }
  if (sum == len) {
    printf("%d\n", now);
    for (int i = 0; i < now; ++i) {
      printf("%d", ans[i].size());
      for (auto v : ans[i]) {
        printf(" %d", v + 1);
      }
      puts("");
    }
  } else
    printf("-1\n");
}
int main() {
  scanf("%s", s);
  len = strlen(s);
  init();
  solve();
  return 0;
}