#include <bits/stdc++.h>
using namespace std;
const long long N = 1010;
long long n, L[N], R[N], sum[N], ans, a[N << 1];
char s[N];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (long long i = 1; i <= n; i++) {
    if (s[i] == '(') {
      L[++L[0]] = i;
      sum[i] = sum[i - 1];
    }
    if (s[i] == ')') {
      R[++R[0]] = i;
      sum[i] = sum[i - 1] + 1;
    }
  }
  for (long long i = 0; i <= n; i++) {
    if (sum[i] == i && sum[i] == sum[n]) return printf("0") & 0;
  }
  for (long long i = 1, j = R[0]; L[i] <= R[j];) {
    a[++ans] = L[i];
    a[++ans] = R[j];
    i++;
    j--;
    if (i > L[0] || !j) break;
  }
  sort(a + 1, a + 1 + ans);
  cout << 1 << endl << ans << endl;
  for (long long i = 1; i <= ans; i++) cout << a[i] << ' ';
  return 0;
}
