#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
int setBit(int n, int x) { return n | (1 << x); }
int clearBit(int n, int x) { return n & ~(1 << x); }
int toggleBit(int n, int x) { return n ^ (1 << x); }
bool checkBit(int n, int x) { return (bool)(n & (1 << x)); }
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
const long long inf = 10000000000000000;
long long __gcd(long long a, long long b) {
  if (a + b == 0) return a + b;
  if (a % b == 0) return b;
  return __gcd(b, a % b);
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) {
    res = res * i;
  }
  return res;
}
long long nCr(long long n, long long r) {
  return fact(n) / (fact(r) * fact(n - r));
}
long long nPr(int n, int r) { return fact(n) / fact(n - r); }
class myComp {
 public:
  bool operator()(pair<int, int> a, pair<int, int> b) {
    return a.second < b.second;
  }
};
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (1LL * res * a) % 1000000007;
    a = (1LL * a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
void yes() {
  cout << "YES"
       << "\n";
  ;
  return;
}
void no() {
  cout << "NO"
       << "\n";
  ;
  return;
}
bool isPrime(long long n) {
  if (n == 1) return true;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool check(string s) {
  int open = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == ')') open++;
  }
  for (int i = 0; i < open; i++) {
    if (s[i] == '(') return false;
  }
  return true;
}
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  int open = 0;
  int close = 0;
  int mn = INT_MAX;
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      open++;
    else
      close++;
  }
  mn = min(open, close);
  vector<int> ans;
  unordered_set<int> st;
  for (int i = 0; i <= mn; i++) {
    st.clear();
    string rem = "";
    int cnt = i;
    int j = 0;
    while (cnt > 0) {
      if (s[j] == '(') {
        st.insert(j);
        cnt--;
      }
      j++;
    }
    j = n - 1;
    cnt = i;
    while (cnt > 0) {
      if (s[j] == ')') {
        st.insert(j);
        cnt--;
      }
      j--;
    }
    for (j = 0; j < n; j++) {
      if (st.count(j) == 0) rem.push_back(s[j]);
    }
    if (check(rem)) {
      for (auto e : st) ans.push_back(e);
      break;
    }
  }
  if (ans.size() == 0) {
    cout << 0 << "\n";
    ;
    return;
  }
  int k = 1;
  int len = ans.size();
  sort((ans).begin(), (ans).end());
  cout << k << "\n";
  ;
  cout << len << "\n";
  ;
  for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " ";
  cout << "\n";
  ;
  return;
}
int32_t main() {
  solve();
  return 0;
}
