#include <bits/stdc++.h>
using namespace std;
long long a[1000005];
void solve() {
  string s;
  cin >> s;
  long long cnt1 = 0, cnt2 = 0;
  long long n = s.length();
  vector<long long> v1, v2, v;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '(')
      v1.push_back(i);
    else
      v2.push_back(i);
  }
  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end(), greater<long long>());
  long long i = 0, j = 0;
  while (i < v1.size() && j < v2.size()) {
    if (v1[i] < v2[j]) {
      v.push_back(v1[i]);
      v.push_back(v2[j]);
      i++;
      j++;
    } else
      i++;
  }
  if (v.size() == 0)
    cout << 0 << endl;
  else
    cout << 1 << endl;
  if (v.size() > 0) {
    sort(v.begin(), v.end());
    cout << v.size() << endl;
    for (long long i = 0; i < v.size(); i++) cout << v[i] + 1 << " ";
  }
}
int main() { solve(); }
