#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
;
const int maxn = 200010;
int dp[maxn][6];
int prestate[maxn][6];
int use[maxn][6];
int yingshe[256];
char str[maxn];
void out(int len, int state) {
  if (len <= 0) return;
  if (use[len][state] == 0) printf("%d ", len);
  out(len - 1, prestate[len][state]);
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%s", str);
    int len = strlen(str);
    for (int i = 0; i <= len; i++) memset(dp[i], -1, sizeof(dp[i]));
    yingshe['o'] = 1;
    yingshe['n'] = 2;
    yingshe['e'] = 3;
    yingshe['t'] = 4;
    yingshe['w'] = 5;
    dp[0][0] = 0;
    for (int i = 0; i < len; i++)
      for (int j = 0; j < 6; j++)
        if (dp[i][j] >= 0) {
          if (dp[i + 1][j] < 0 || dp[i + 1][j] > dp[i][j] + 1) {
            dp[i + 1][j] = dp[i][j] + 1;
            prestate[i + 1][j] = j;
            use[i + 1][j] = 0;
          }
          if ((j == 2 && str[i] == 'e') || (j == 5 && str[i] == 'o'))
            continue;
          else {
            int nxt_t = 0;
            if (str[i] == 'o')
              nxt_t = 1;
            else if (str[i] == 'n' && j == 1)
              nxt_t = 2;
            else if (str[i] == 't')
              nxt_t = 4;
            else if (str[i] == 'w' && j == 4)
              nxt_t = 5;
            if (dp[i + 1][nxt_t] < 0 || dp[i + 1][nxt_t] > dp[i][j]) {
              dp[i + 1][nxt_t] = dp[i][j];
              prestate[i + 1][nxt_t] = j;
              use[i + 1][nxt_t] = 1;
            }
          }
        }
    int ans = 1e9;
    int ansidx = 0;
    for (int i = 0; i < 6; i++)
      if (ans > dp[len][i] && dp[len][i] >= 0) {
        ans = dp[len][i];
        ansidx = i;
      }
    printf("%d\n", dp[len][ansidx]);
    out(len, ansidx);
    puts("");
  }
}
