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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 23).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemCZebras solver = new ProblemCZebras();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemCZebras {
        ArrayList<Integer>[] arrayLists;
        boolean flag = true;
        int[] BIT;
        int[] BIT1;

        private void update(int x, int nval, int oval, int N) {
            for (; x <= N; x += (x & -x)) BIT[x] += (nval - oval);
        }

        private void update1(int x, int nval, int oval, int N) {
            for (; x <= N; x += (x & -x)) BIT1[x] += (nval - oval);
        }

        private long query(int x) {
            long sum = 0;
            for (; x > 0; x -= (x & -x)) sum += BIT[x];
            return sum;
        }

        private long query1(int x) {
            long sum = 0;
            for (; x > 0; x -= (x & -x)) sum += BIT1[x];
            return sum;
        }

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            String s = in.scanString();
            arrayLists = new ArrayList[s.length() + 1];
            for (int i = 0; i <= s.length(); i++) arrayLists[i] = new ArrayList<>();
            BIT = new int[s.length() + 1];
            BIT1 = new int[s.length() + 1];
            int temp[] = new int[s.length() + 1];
            for (int i = 1; i <= s.length(); i++) {
                update(i, 1, 0, s.length());
                temp[i] = -1;
            }
            for (int i = 0; i < s.length(); i++) {
                if (s.charAt(i) == '0') {
                    int index = -1;
                    int llow = 1;
                    int high = s.length();
                    while (llow <= high) {
                        int mid = (llow + high) / 2;
                        if (query(mid) == 1) {
                            index = mid;
                            high = mid - 1;
                        } else if (query(mid) > 1) {
                            high = mid - 1;
                        } else {
                            llow = mid + 1;
                        }
                    }
                    if (index != -1) {
                        arrayLists[index].add(i + 1);
                        update(index, 0, 1, s.length());
                        update1(index, 1, 0, s.length());
                        temp[index] = 0;
                    }
                } else {
                    int index = -1;
                    int llow = 1;
                    int high = s.length();
                    while (llow <= high) {
                        int mid = (llow + high) / 2;
                        if (query1(mid) == 1) {
                            index = mid;
                            high = mid - 1;
                        } else if (query1(mid) > 1) {
                            high = mid - 1;
                        } else {
                            llow = mid + 1;
                        }
                    }
                    if (index != -1) {
                        arrayLists[index].add(i + 1);
                        update(index, 1, 0, s.length());
                        update1(index, 0, 1, s.length());
                        temp[index] = 1;
                    } else {
                        flag = false;
                    }

                }
            }
            for (int i = 0; i <= s.length(); i++)
                if (arrayLists[i].size() != 0 && temp[i] == 1) flag = false;
            if (flag) {
                int ans = 0;
                for (int i = 0; i <= s.length(); i++) if (arrayLists[i].size() != 0) ans++;
                out.println(ans);
                for (int i = 0; i <= s.length(); i++) {
                    if (arrayLists[i].size() == 0) continue;
                    out.print(arrayLists[i].size() + " ");
                    for (int j = 0; j < arrayLists[i].size(); j++) out.print(arrayLists[i].get(j) + " ");
                    out.println();
                }
            } else out.println(-1);
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public String scanString() {
            int c = scan();
            if (c == -1) return null;
            while (isWhiteSpace(c)) c = scan();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return res.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

