#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
  long long res = 1;
  a %= mod;
  if (b < 0) return 1;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
char s[maxn];
set<int> one, zero;
vector<int> ans[maxn];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i < (len + 1); ++i) {
    if (s[i] == '1')
      one.insert(i);
    else
      zero.insert(i);
  }
  int fg = 0;
  int pos = -1;
  int cnt = 0;
  set<int>::iterator it;
  while (one.size()) {
    if (!fg) {
      if (zero.size() == 0) return puts("-1"), 0;
      it = zero.lower_bound(pos);
      if (it == zero.end()) return puts("-1"), 0;
      pos = *it;
      ans[cnt].push_back(*it);
      zero.erase(it);
    } else {
      it = one.lower_bound(pos);
      if (it == one.end())
        cnt++, pos = -1;
      else {
        pos = *it;
        ans[cnt].push_back(*it);
        one.erase(it);
      }
    }
    if (one.size() == 0) {
      if (zero.size() == 0) return puts("-1"), 0;
      it = zero.lower_bound(pos);
      if (it == zero.end()) return puts("-1"), 0;
      pos = *it;
      ans[cnt++].push_back(*it);
      zero.erase(it);
      break;
    }
    fg = 1 - fg;
  }
  while (zero.size()) {
    ans[cnt++].push_back(*zero.begin());
    zero.erase(zero.begin());
  }
  printf("%d\n", cnt);
  for (int i = 0; i < (cnt); ++i) {
    printf("%d", ans[i].size());
    for (int j = 0; j < (ans[i].size()); ++j) {
      printf(" %d", ans[i][j]);
    }
    puts("");
  }
  return 0;
}
