#include <bits/stdc++.h>
using namespace std;
int main() {
  char s[1100];
  scanf("%s", s);
  int n = strlen(s);
  int n1 = 0, n2 = 0;
  int l[1100], r[1100];
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      l[++n1] = i;
    else
      r[++n2] = i;
  }
  int now = n2;
  int ans = 0, an[1100];
  for (int i = 1; i <= n1; i++) {
    if (now < 1) break;
    if (l[i] > r[now]) break;
    an[++ans] = l[i];
    an[++ans] = r[now];
    now--;
  }
  if (ans == 0) {
    printf("0");
  } else {
    printf("1\n%d\n", ans);
    sort(an + 1, an + 1 + ans);
    for (int i = 1; i <= ans; i++) printf("%d ", an[i] + 1);
  }
  return 0;
}
