#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
char s[N];
int stp[N], ans[N], ti, len, sum;
int last[N], bef[N];
int sta1[N], sta2[N], t1, t2;
int main() {
  scanf("%s", s + 1);
  len = strlen(s + 1);
  while (len > 0) {
    bool flag = 0, c1 = 0, c2 = 0;
    for (int i = 1; i <= len; i++) {
      if (s[i] == '(')
        c1 = 1;
      else if (c1) {
        flag = 1;
        break;
      }
    }
    if (!flag) break;
    for (int i = 1; i <= len; i++)
      if (s[i] == '(') sta1[++t1] = i;
    for (int i = len; i >= 1; i--)
      if (s[i] == ')') sta2[++t2] = i;
    int mxx = -1;
    for (int i = 1; i <= min(t1, t2); i++)
      if (sta2[i] > sta1[i])
        mxx = i;
      else
        break;
    stp[++ti] = 2 * mxx;
    for (int i = 1; i <= mxx; i++) ans[sum + i] = sta1[i], s[sta1[i]] = '~';
    sum += mxx;
    for (int i = 1; i <= mxx; i++)
      ans[sum + i] = sta2[mxx - i + 1], s[sta2[mxx - i + 1]] = '~';
    sum += mxx;
    for (int j = 1; j <= len; j++) {
      if (s[j] == '~') {
        for (int k = j; k <= len - 1; k++) s[k] = s[k + 1];
        j--;
        len--;
      }
    }
  }
  printf("%d\n", ti);
  int now = 0;
  for (int i = 1; i <= ti; i++) {
    printf("%d\n", stp[i]);
    for (int j = 1; j <= stp[i]; j++) printf("%d ", ans[now + j]);
    printf("\n");
    now += stp[i];
  }
  return 0;
}
