C. Zebras

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 0and 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

Copy

0010100

output

3
3 1 3 4
3 2 5 6
1 7

input

Copy

111

output

-1

做题的时候再次审题审错了，他不要求是连续的！！！

比如00001100.我的理解是输出-1，但是实际上可以把11拆开放到不同的里头。

我们准备一个vec队列。

我们0向下走，1向上走。

比如00001100.

第一个0，+1（向下走），vec【1】=0

第二个0，+1，vec【2】=0

第三个0，+1，vec【3】=0

第四个0，+1，vec【4】=0

第五个1，先更新当前vec【4】=01， -1（向上走）cnt=3

第六个1，先更新当前vec【3】=01,-1(向上走，cnt=3.

第七个0，向下走。我们这样来。

就是这样维护了所有栈，这些队列最后一个永远是0.

如果是000011111.

我们维护

01

01

01

01

这是我们向上走到0了。

这是时候如果下一个还是1，我们队列已经没有以0结尾的了，就错误了。

如果是0，我们放到第一个。

就变成了

010

01

01

01

这时候我们只有第一个是合格的。

但是我们一共分了4组，而我们str已经遍历完了，这样1！=4，所以也报错。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include<set>
#include <algorithm>
using namespace std;
int n,m;
string str;
vector<int>vec[200100];


int main()
{
    cin>>str;
    int len=str.length();
    int maxx=0;
    int gaizi=0;
    int flag=0;
    for(int i=0;i<len;i++)
    {
        if(str[i]=='0')
        {
            gaizi++;
            vec[gaizi].push_back(i);
        }
        else
        {
            if(gaizi==0)
             {
              flag=1;
              break;
             }
            vec[gaizi].push_back(i);
            gaizi--;
        }
        maxx=max(maxx,gaizi);
    }
    if(maxx!=gaizi||flag==1)
            cout<<"-1"<<endl;
    else
    {


    printf("%d\n",maxx);
    for(int i=1;i<=maxx;i++)
    {
        printf("%d",vec[i].size());
        for(int j=0;j<vec[i].size();j++)
        {
            printf(" %d",vec[i][j]+1);
        }
       cout<<endl;
    }
    }
}