#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  int n = s.size();
  stack<int> st;
  vector<int> ans;
  vector<int> pref(n + 1);
  vector<int> suff(n + 1);
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      pref[i + 1] += pref[i] + 1;
    else
      pref[i + 1] = pref[i];
  }
  if (s[n - 1] == ')') suff[n - 1] = 1;
  for (int i = n - 2; i >= 0; i--) {
    if (s[i] == ')')
      suff[i] += suff[i + 1] + 1;
    else
      suff[i] = suff[i + 1];
  }
  int maxi = 0;
  int idx = -1;
  for (int i = 0; i <= n; i++) {
    if (pref[i] == suff[i]) {
      idx = i;
      break;
    }
  }
  for (int i = 0; i <= n; i++) {
    if (s[i] == '(' && i < idx) {
      ans.push_back(i + 1);
    } else if (s[i] == ')' && i >= idx) {
      ans.push_back(i + 1);
    }
  }
  sort(ans.begin(), ans.end());
  if (ans.size() >= 1) {
    cout << 1 << endl;
    cout << ans.size() << endl;
    for (auto i : ans) {
      cout << i << " ";
    }
  } else {
    cout << 0;
  }
  return 0;
}
