#include <bits/stdc++.h>
using namespace std;
char s[1000005];
int n;
int ans1[1000005];
int ans2[1000005];
int find() {
  int cnt = 0;
  int l, r;
  for (int l = 1, r = n;; ++l) {
    if (l >= r) break;
    if (s[l] == '(') {
      while (s[r] != ')' && r > l) --r;
      if (r > l) {
        ++cnt;
        ans1[cnt] = l;
        ans2[cnt] = r;
        --r;
      } else {
        return cnt;
      }
    }
  }
  return cnt;
}
int main() {
  scanf("%s", s + 1);
  n = (int)strlen(s + 1);
  if (find() == 0)
    puts("0");
  else {
    int cnt = find();
    puts("1");
    printf("%d\n", 2 * cnt);
    for (int i = 1; i <= cnt; ++i) printf("%d ", ans1[i]);
    for (int i = cnt; i >= 1; --i) printf("%d ", ans2[i]);
    printf("\n");
  }
  return 0;
}
