#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) {
  long long z = y;
  while (x % y != 0) {
    z = x % y;
    x = y;
    y = z;
  }
  return z;
}
char s[200105];
set<int> sp[2];
vector<vector<int>> vp;
void fmain(int ID) {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int(i) = 1; (i) <= (int)(n); (i)++) sp[s[i] - '0'].insert(i);
  while (!sp[0].empty() || !sp[1].empty()) {
    if (sp[0].empty()) et();
    vector<int> tmp;
    tmp.push_back(*sp[0].begin());
    sp[0].erase(sp[0].begin());
    int tar = 1;
    while (!sp[tar].empty()) {
      int x = tmp.back();
      auto it = sp[tar].lower_bound(x);
      if (it == sp[tar].end()) break;
      tmp.push_back(*it);
      sp[tar].erase(it);
      tar ^= 1;
    }
    if (s[tmp.back()] == '1') et();
    vp.push_back(tmp);
  }
  printf("%d\n", vp.size());
  for (auto &p : vp) {
    printf("%d", p.size());
    for (int c : p) printf(" %d", c);
    puts("");
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
