#include <bits/stdc++.h>
using namespace std;
template <typename input>
void Debug(input x) {
  cout << x << " "
       << " is not working "
       << "\n";
}
bool is_prime(int x) {
  if (x == 1) {
    return false;
  }
  int i = 2;
  while (i * i <= x) {
    if (x % i == 0) {
      return false;
    }
    i++;
  }
  return true;
}
int largestFactor(int n) {
  for (int i = n - 1; i >= n / 2; i--) {
    if (n % i == 0) {
      return i;
    }
  }
  return -1;
}
bool vis[10000000];
bool dp[10000000];
bool Check(int n) {
  if (vis[n] == true) return dp[n];
  if (n == 0) {
    return dp[0];
  } else if (n < 0) {
    return false;
  }
  vis[n] = true;
  bool x = Check(n - 2020);
  bool y = Check(n - 2021);
  if (x == true || y == true) return dp[n] = true;
  return dp[n] = false;
}
void Solve() {
  string s;
  cin >> s;
  int n = s.size();
  int r = n - 1;
  int l = 0;
  int num = 0;
  vector<int> ans;
  while (l < r) {
    if (s[l] == '(' && s[r] == ')') {
      ans.push_back(l);
      ans.push_back(r);
      ++num;
      l++;
      r--;
    } else if (s[l] == '(' && s[r] == '(') {
      r--;
    } else if (s[l] == ')' && s[r] == ')') {
      l++;
    } else {
      r--;
      l++;
    }
  }
  if (ans.size() == 0) {
    cout << 0 << "\n";
    return;
  } else
    cout << 1 << "\n";
  cout << ans.size() << "\n";
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] + 1 << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  Solve();
}
