#include <bits/stdc++.h>
const long double pie = 3.1415926535;
using namespace std;
long long fpow(long long n, long long p) {
  long long m = 1;
  while (p) {
    if (p % 2) m *= n;
    p >>= 1;
    n *= n;
  }
  return m;
}
long long mfpow(long long n, long long p, long long M) {
  long long m = 1;
  n %= M;
  while (p) {
    if (p % 2) m = (m * n) % M;
    n = (n * n) % M;
    p >>= 1;
  }
  return m % M;
}
bool br1, br2, br;
char ch, ch1, ch2;
long long n, k, x, y, z, mini, maxi, l, ind, ini, sum, t, len, r, w, imini, m;
string s, s1, s2;
long long a[(int)1e6 + 100];
long long b[(int)1e6 + 100];
set<long long> st0, st1;
vector<vector<long long> > v;
vector<long long> v1;
void solve() {
  cin >> s;
  n = s.length();
  if (s[0] == '0')
    a[0] = 1;
  else
    br = 1;
  if (s[n - 1] == '0')
    b[n - 1] = 1;
  else
    br = 1;
  for (long long i = 1; i < n; i++) {
    a[i] = a[i - 1];
    if (s[i] == '0')
      a[i]++;
    else
      a[i]--;
  }
  for (long long i = n - 2; i >= 0; i--) {
    b[i] = b[i + 1];
    if (s[i] == '0')
      b[i]++;
    else
      b[i]--;
  }
  for (long long i = 0; i < n; i++)
    if (s[i] == '1' && (a[i] < 0 || b[i] < 0)) br = 1;
  if (br) {
    cout << "-1" << endl;
    return;
  }
  for (long long i = 0; i < n; i++) {
    if (s[i] == '0')
      st0.insert(i);
    else
      st1.insert(i);
  }
  while (st1.size()) {
    v1.clear();
    x = *(st0.begin());
    y = *(st1.begin());
    v1.push_back(x);
    v1.push_back(y);
    while (true) {
      x = *(st0.upper_bound(y));
      v1.push_back(x);
      if (st1.upper_bound(x) != st1.end()) {
        y = *st1.upper_bound(x);
        v1.push_back(y);
      } else
        break;
    }
    v.push_back(v1);
    m = v1.size();
    for (long long i = 0; i < m; i++) {
      if (i % 2)
        st1.erase(v1[i]);
      else
        st0.erase(v1[i]);
    }
  }
  for (auto i : st0) {
    v1.clear();
    v1.push_back(i);
    v.push_back(v1);
  }
  cout << v.size() << endl;
  for (auto i : v) {
    cout << i.size() << " ";
    for (auto j : i) cout << j + 1 << " ";
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  solve();
  return 0;
}
