#include <bits/stdc++.h>
using namespace std;
long long int bg = 998244353;
long long int gcd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long int power(long long int x, long long int y, long long int p) {
  if (x == 0) return 0;
  if (y == 0) return 1;
  long long int s = y / 2;
  long long int f = power(x, s, p) % p;
  if (y % 2 == 0)
    return (f * f) % p;
  else
    return (((f * f) % p) * x % p) % p;
}
void build1(long long int node, long long int seg[], long long int arr[],
            long long int start, long long int end) {
  if (start == end) {
    seg[node] = arr[start];
    return;
  }
  long long int mid = (start + end) / 2;
  build1(2 * node, seg, arr, start, mid);
  build1(2 * node + 1, seg, arr, mid + 1, end);
  seg[node] = seg[2 * node] + seg[2 * node + 1];
}
long long int query1(long long int node, long long int seg[],
                     long long int arr[], long long int start,
                     long long int end, long long int l, long long int r) {
  long long int mid = (start + end) / 2;
  if (r < start || l > end)
    return 0;
  else if (l <= start && r >= end)
    return seg[node];
  else
    return query1(2 * node, seg, arr, start, mid, l, r) +
           query1(2 * node + 1, seg, arr, mid + 1, end, l, r);
}
vector<long long int> master;
void dfs(long long int d[], vector<long long int> adj[], long long int arr[],
         long long int v) {
  master.push_back(v);
  arr[v] = 1;
  long long int sum = 0;
  for (int u : adj[v]) {
    if (!arr[u]) {
      dfs(d, adj, arr, u);
      sum += d[u];
    }
  }
  d[v] = 1 + sum;
}
int main() {
  long long int i, n, j;
  string s1;
  cin >> s1;
  n = s1.length();
  vector<vector<long long int>> boom;
  stack<long long int> s[2];
  for (i = 0; i < n; i++) {
    if (s1[i] == '1') {
      if (s[0].empty() == 1) {
        cout << "-1";
        return 0;
      } else {
        long long int k = s[0].top();
        s[0].pop();
        boom[k].push_back(i + 1);
        s[1].push(k);
      }
    } else {
      if (s[1].empty() == 1) {
        vector<long long int> vec;
        vec.push_back(i + 1);
        boom.push_back(vec);
        s[0].push(boom.size() - 1);
      } else {
        long long int k = s[1].top();
        s[1].pop();
        boom[k].push_back(i + 1);
        s[0].push(k);
      }
    }
  }
  if (s[1].empty() != 1)
    cout << "-1";
  else {
    long long int v = s[0].size();
    cout << s[0].size() << '\n';
    for (i = 0; i < v; i++) {
      cout << boom[i].size() << " ";
      for (j = 0; j < boom[i].size(); j++) cout << boom[i][j] << " ";
      cout << '\n';
    }
  }
  return 0;
}
