Problem: You are given a non-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string "two" (or both at the same time) as a substring. In other words, Polycarp does not like the string s if there is an integer j (1 ≤ j ≤ n-2), that s_{j}s_{j+1}s_{j+2}="one" or s_{j}s_{j+1}s_{j+2}="two".

For example:

  * Polycarp does not like strings "oneee", "ontwow", "twone" and "oneonetwo" (they all have at least one substring "one" or "two"), 
  * Polycarp likes strings "oonnee", "twwwo" and "twnoe" (they have no substrings "one" and "two"). 



Polycarp wants to select a certain set of indices (positions) and remove all letters on these positions. All removals are made at the same time.

For example, if the string looks like s="onetwone", then if Polycarp selects two indices 3 and 6, then "onetwone" will be selected and the result is "ontwne".

What is the minimum number of indices (positions) that Polycarp needs to select to make the string liked? What should these positions be?

Input

The first line of the input contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases in the input. Next, the test cases are given.

Each test case consists of one non-empty string s. Its length does not exceed 1.5⋅10^5. The string s consists only of lowercase Latin letters.

It is guaranteed that the sum of lengths of all lines for all input data in the test does not exceed 1.5⋅10^6.

Output

Print an answer for each test case in the input in order of their appearance.

The first line of each answer should contain r (0 ≤ r ≤ |s|) — the required minimum number of positions to be removed, where |s| is the length of the given line. The second line of each answer should contain r different integers — the indices themselves for removal in any order. Indices are numbered from left to right from 1 to the length of the string. If r=0, then the second line can be skipped (or you can print empty). If there are several answers, print any of them.

Examples

Input


4
onetwone
testme
oneoneone
twotwo


Output


2
6 3
0

3
4 1 7 
2
1 4


Input


10
onetwonetwooneooonetwooo
two
one
twooooo
ttttwo
ttwwoo
ooone
onnne
oneeeee
oneeeeeeetwooooo


Output


6
18 11 12 1 6 21 
1
1 
1
3 
1
2 
1
6 
0

1
4 
0

1
1 
2
1 11 

Note

In the first example, answers are:

  * "onetwone", 
  * "testme" — Polycarp likes it, there is nothing to remove, 
  * "oneoneone", 
  * "twotwo". 



In the second example, answers are: 

  * "onetwonetwooneooonetwooo", 
  * "two", 
  * "one", 
  * "twooooo", 
  * "ttttwo", 
  * "ttwwoo" — Polycarp likes it, there is nothing to remove, 
  * "ooone", 
  * "onnne" — Polycarp likes it, there is nothing to remove, 
  * "oneeeee", 
  * "oneeeeeeetwooooo". 

Solution (in JAVA):

Solution:

import org.w3c.dom.ls.LSOutput;

import java.util.*;
import java.util.function.IntBinaryOperator;


public class Example {
    static long[][] dp;
    //  static    int[]  ar;
    static int mod = 1000000000 + 7;
    static long[] ans = new long[100000 + 1];
    static List<List<Integer>> adj;
    static int[] vis;
    static int[] dis;
    static int row;
    static boolean[] chosen;
    static List<Integer> permutation;
    static int k;
    static int count;
    static int[][] arr;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
      int t= sc.nextInt();
      while(t>0){
          StringBuilder ans=new StringBuilder();
          t--;
          String s=sc.next();
          int c=0;
          int i=0;
          while(i<s.length()-2){
                   String ss=s.substring(i,i+3);
                   if(ss.equals("two")|| ss.equals("one")){
                       c++;
                       if(ss.charAt(2)=='o' && i+3<s.length() ){
                           if(s.charAt(i+3)=='n') {
                               ans.append(i + 3).append(" ");
                               i+=3;
                           }else{
                               ans.append(i+2).append(" ");

                               i+=3;
                           }


                       }else{


                       ans.append(i+2).append(" ");
                       i=i+3;}



                   }else {
                       i++;
                   }


          }
          int n=c;
          if(n==0){
              System.out.println(0);
            //  System.out.println();
          }else{
              System.out.println(c);
              System.out.println(ans);

          }
      }

    }












    private static void swap(int i, int j, int[] arrr) {
        int temp=arrr[i];
        arrr[i]=arrr[j];
        arrr[j]=temp;
    }

    private static long getsum(int[][] h, int i, int p,long[][] dp) {

        if(i>=h[0].length){
            return 0;
        }
        if(dp[i][p]!=-1){
            return   dp[i][p];
        }

        if(p==0){
            long a=getsum(h,i+1,p,dp);
            a=Math.max(a,h[1][i]+getsum(h,i+1,1,dp));
          a=  Math.max(a,h[2][i]+getsum(h,i+1,2,dp));
            return   dp[i][p]=a;
        }else if(p==1){
            long a=getsum(h,i+1,p,dp);
            //a=Math.max(a,h[i][1]+getsum(h,i+1,1));
            a=  Math.max(a,h[2][i]+getsum(h,i+1,2,dp));
            return   dp[i][p]=a;
        }else{
            long  a=getsum(h,i+1,p,dp);
            a=Math.max(a,h[1][i]+getsum(h,i+1,1,dp));
          //  a=  Math.max(a,h[i][2]+getsum(h,i+1,2));
            return   dp[i][p]=a;
        }

    }

    private static int getans(int[] arr, int i) {
        if(i<0)
            return 0;
        else{
            int min=mod;
            for(int j=0;j<arr.length;j++){
                if(arr[j]==1){
                    arr[j]=2;
                    for(int k=0;k<j;k++){
                        if(arr[k]==0){
                            arr[k]=2;
                            min=Math.min(min,Math.abs(j-k)+getans(arr,i-1));
                        }
                    }
                }
            }
            return min;
        }
    }

    private static int ncr(int notsure, int i) {
        int a=1;
        a=(factorail(notsure))/(factorail(notsure-1)*(factorail(i)));
        return a;
    }

    private static int factorail(int notsure) {
        int fac=1;
        for(int i=2;i<=notsure;i++){
            fac=fac+i;
        }
        return fac;

    }

    private static void allPerMutation(int n) {
        if(permutation.size()==n){
            //   System.out.println(permutation);
            long sum=arr[1][permutation.get(0)];
            for(int i=0;i<permutation.size()-1;i++){
                sum+=arr[permutation.get(i)][permutation.get(i+1)];
            }
            sum=sum+arr[permutation.get(n-1)][1];
            if(sum==k){
                count++;
            }

        }else{
            for(int i=2;i<=(n+1);i++){
                if(chosen[i]){
                    continue;
                }
                permutation.add(i);
                chosen[i]=true;
                allPerMutation(n);
                permutation.remove(permutation.size()-1);
                chosen[i]=false;
            }


        }




    }


    public static int Check(int[] arr,int k){
        int sum=0;
        int j=1;
        int total=0;
        for(int i=1;i<arr.length;i++){
            sum+=arr[i];
            if(sum==k){
                total+=(i-j);
                j=i+1;
                sum=0;
            }if(sum>k){
                return arr.length;
            }
        }
        return total;


    }
    public static  char[][] rotateTheBox(char[][] box) {
        Stack<Character> st;
        int m=box.length;
        int n=box[0].length;
        char[][] cc= new char[box[0].length][box.length];
        int k=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cc[i][j]='.';
            }
        }
        for(int i=m-1;i>=0;i--){

            st=new Stack<>();
            for(int j=0;j<n;j++){
                char c=box[i][j];
                if(c=='#'){
                    st.push(c);
                }else if(c=='*'){
                    cc[j][k]='*';
                    for(int p=j-1;p>=0;p--){
                        if(!st.isEmpty())
                        cc[p][k]=st.pop();
                        else
                            break;
                    }
                    st=new Stack<>();
                }
            }
            if(!st.isEmpty()){
                for(int p=n-1;p>=0;p--){
                    if(!st.isEmpty())
                        cc[p][k]=st.pop();
                    else
                        break;
                }
            }
            k++;


        }
        return cc;


    }







    private static long findans(int[] arr, int i, int s) {
        if (i < 0 && s == 0)
            return 0;
        if (i < 0 && s == 1)
            return 0;
        if (dp[i][s] != -1) {
            return dp[i][s];
        } else {


            if (s == 0)
                return dp[i][s] = Math.max(findans(arr, i - 1, s), -1 * arr[i] + findans(arr, i - 1, 1 - s));
            else
                return dp[i][s] = Math.max(findans(arr, i - 1, s), arr[i] + findans(arr, i - 1, 1 - s));
        }
    }

    public static void dfs(int v, int di) {
        dis[v] = di;
        vis[v] = 1;
        for (int i = 0; i < adj.get(v).size(); i++) {
            int x = adj.get(v).get(i);
            if (vis[x] == 0) {
                dfs(x, di + 1);
            }
        }
    }

    private static boolean isPrime(long a) {
        if (a == 1)
            return true;

        for (int i = 2; i * i <= a; i++) {
            if (a % i == 0)
                return false;

        }
        return true;
    }

    private static int gcd(int aa, int bb) {
        if (bb == 0)
            return aa;
        return gcd(bb, aa % bb);

    }

    private static int lowerBound(int[] ar, int a) {
        int res = 0;
        int s = 1;
        int e = ar.length - 1;
        while (s <= e) {
            int mid = (s) + (e - s) / 2;
            if (ar[mid] <= a) {
                res = mid;
                s = mid + 1;

            } else {
                e = mid - 1;
            }
        }
        return res;
    }

    public static int getXORSum(int[] arr1, int[] arr2) {

        long c = 0;
        int n = arr1.length;
        int m = arr2.length;
        if (n == 1 && m == 1) {
            return arr1[0] & arr2[0];
        }
        int aa = n + m;
        for (int i = 0; i < 32; i++) {

            int z = 0;
            int o = 0;
            int cc = 0;
            for (int a : arr1) {


                int x = (a & (1 << i));
                if (x == 0)
                    z++;
                else
                    o++;


            }
            for (int a : arr2) {
                int x = (a & (1 << i));
                if (x == 0)
                    z++;
                else
                    o++;
            }

            System.out.println(z + " " + o);

            if (z != aa && o != aa) {
                c = c + (1 << i);

            }


        }
        return (int) c;


    }


}