#include <bits/stdc++.h>
const long long MX = 2 * 100 * 1000 + 1000, inf = 3e18,
                mod = 1000 * 1000 * 1000 + 7;
using namespace std;
vector<long long> ans[MX];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  long long n = s.size();
  long long one = 0, num = 0;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '1') {
      if (one < num) {
        ans[one].push_back(i);
        one++;
      } else {
        return cout << -1 << endl, 0;
      }
    } else {
      if (one > 0) {
        one--;
        ans[one].push_back(i);
      } else {
        ans[num].push_back(i);
        num++;
      }
    }
  }
  if (one) {
    return cout << -1 << endl, 0;
  }
  cout << num << endl;
  for (long long i = 0; i < num; i++) {
    cout << ans[i].size() << ' ';
    for (long long j = 0; j < ans[i].size(); j++) {
      cout << ans[i][j] + 1 << ' ';
    }
    cout << endl;
  }
}
