#include <bits/stdc++.h>
using namespace std;
long long barr[1010], carr[1010];
vector<long long> res, ans1, ans2;
int main() {
  long long t, n, i, j, K, k, l, m;
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  t = 1;
  while (t--) {
    string str;
    cin >> str;
    for (i = 0; i < str.length(); i++) {
      if (str[i] == '(') barr[i]++;
      if (i > 0) barr[i] += barr[i - 1];
    }
    for (i = str.length() - 1; i >= 0; i--) {
      if (str[i] == ')') carr[i]++;
      carr[i] += carr[i + 1];
    }
    long long maxi = 0, idx = -1;
    for (i = 0; i < str.length(); i++) {
      long long tmp = min(barr[i], carr[i]);
      if (tmp > maxi) {
        maxi = tmp;
        idx = i;
      }
    }
    if (maxi) {
      cout << 1 << '\n';
      cout << maxi * 2 << '\n';
      long long cnt = 0;
      for (i = 0; i <= idx; i++) {
        if (str[i] == '(') cout << i + 1 << ' ', cnt++;
        if (cnt == maxi) break;
      }
      cnt = 0;
      for (i = str.length() - 1; i >= idx; i--) {
        if (str[i] == ')') res.push_back(i + 1), cnt++;
        if (cnt == maxi) break;
      }
      sort(res.begin(), res.end());
      for (i = 0; i < res.size(); i++) cout << res[i] << ' ';
      cout << '\n';
    } else {
      cout << 0 << '\n';
    }
  }
  return 0;
}
