#include <bits/stdc++.h>
using namespace std;
int const INF = 1e8 + 100;
const int MOD = 998244353;
const int N = (int)1e6 + 123;
const long double EPS = 3e-16;
void faster() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int simple(int n) {
  int i, sq;
  if (n % 2 == 0) {
    return 0;
  }
  sq = (int)sqrt(n);
  for (i = 3; i <= sq; i++) {
    if ((n % i) == 0) {
      return 0;
    }
  }
  return 1;
}
long long gcd(long long a, long long b) {
  if (a > b) swap(a, b);
  if (!a) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
vector<int> v;
void solve() {
  string s;
  cin >> s;
  int a = 0, b = 0, ok = 0, used[s.size()];
  for (int i = 0; i < s.size(); i++) {
    used[i] = 0;
  }
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '(' && !used[i]) {
      for (int j = s.size() - 1; j > i; j--) {
        if (s[j] == ')' && !used[j]) {
          ok = 1;
          used[i] = 1;
          used[j] = 1;
          v.push_back(i);
          v.push_back(j);
          break;
        }
      }
    }
  }
  sort(v.begin(), v.end());
  if (!ok) {
    cout << 0;
    return;
  }
  cout << 1 << "\n";
  cout << v.size() << "\n";
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] + 1 << " ";
  }
}
int main() {
  faster();
  int T = 1;
  while (T--) {
    solve();
  }
}
