#include <bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using uint = unsigned int;
using pii = pair<int, int>;
template <class T>
void cmax(T& x, const T& y) {
  if (x < y) x = y;
}
template <class T>
void cmin(T& x, const T& y) {
  if (x > y) x = y;
}
template <class T>
void sort(vector<T>& v) {
  sort(v.begin(), v.end());
}
template <class T>
void reverse(vector<T>& v) {
  reverse(v.begin(), v.end());
}
template <class T>
void unique(vector<T>& v) {
  sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end());
}
const int SZ = 1 << 23 | 233;
struct FILEIN {
  char qwq[SZ], *S = qwq, *T = qwq, ch;
  char GETC() {
    return (S == T) && (T = (S = qwq) + fread(qwq, 1, SZ, stdin), S == T)
               ? EOF
               : *S++;
  }
  FILEIN& operator>>(char& c) {
    while (isspace(c = GETC()))
      ;
    return *this;
  }
  FILEIN& operator>>(string& s) {
    while (isspace(ch = GETC()))
      ;
    s = ch;
    while (!isspace(ch = GETC())) s += ch;
    return *this;
  }
  template <class T>
  void read(T& x) {
    bool sign = 0;
    while ((ch = GETC()) < 48) sign ^= (ch == 45);
    x = (ch ^ 48);
    while ((ch = GETC()) > 47) x = (x << 1) + (x << 3) + (ch ^ 48);
    x = sign ? -x : x;
  }
  FILEIN& operator>>(int& x) { return read(x), *this; }
  FILEIN& operator>>(ll& x) { return read(x), *this; }
} in;
struct FILEOUT {
  const static int LIMIT = 1 << 22;
  char quq[SZ], ST[233];
  int sz, O;
  ~FILEOUT() { flush(); }
  void flush() {
    fwrite(quq, 1, O, stdout);
    fflush(stdout);
    O = 0;
  }
  FILEOUT& operator<<(char c) { return quq[O++] = c, *this; }
  FILEOUT& operator<<(string str) {
    if (O > LIMIT) flush();
    for (char c : str) quq[O++] = c;
    return *this;
  }
  template <class T>
  void write(T x) {
    if (O > LIMIT) flush();
    if (x < 0) {
      quq[O++] = 45;
      x = -x;
    }
    do {
      ST[++sz] = x % 10 ^ 48;
      x /= 10;
    } while (x);
    while (sz) quq[O++] = ST[sz--];
  }
  FILEOUT& operator<<(int x) { return write(x), *this; }
  FILEOUT& operator<<(ll x) { return write(x), *this; }
} out;
signed main() {
  string s;
  in >> s;
  long long len = s.length();
  vector<long long> pp(len + 2, 0);
  vector<long long> ss(len + 2, 0);
  for (long long i = 0; i < len; i++)
    if (i)
      pp[i] = pp[i - 1] + (s[i] == '(');
    else
      pp[i] = (s[i] == '(');
  for (long long i = len - 1; ~i; i--) ss[i] = ss[i + 1] + (s[i] == ')');
  auto solve = [&]() {
    long long ans = 0;
    for (long long i = 1; i < len; i++) cmax(ans, min(pp[i - 1], ss[i]));
    if (!ans) {
      out << 0 << '\n';
      return 0;
    }
    out << 1 << '\n';
    out << ans * 2 << '\n';
    long long tmp = ans;
    for (long long i = 0; i < len; i++)
      if (ans && s[i] == '(') {
        out << i + 1 << ' ';
        ans--;
      }
    ans = tmp;
    vector<long long> res;
    for (long long i = len - 1; ~i; i--)
      if (ans && s[i] == ')') {
        res.emplace_back(i + 1);
        ans--;
      }
    while (res.size()) out << res.back() << ' ', res.pop_back();
  };
  solve();
  return 0;
}
