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 java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Contest {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    public static void main(String[] args) {
        new Contest().run();
    }

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time(ms) = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }

    class MyComparator implements Comparable<MyComparator> {

        int x;
        int y;

        public MyComparator(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(MyComparator a) {
            if (x == a.x) {
                return (y - a.y);
            }
            return x - a.x;
        }
    }

    public static boolean isPrime(int num) {
        if (num > 2 && num % 2 == 0) {
            //System.out.println(num + " is not prime");
            return false;
        }
        int top = (int) Math.sqrt(num) + 1;
        for (int i = 3; i < top; i += 2) {
            if (num % i == 0) {
                //System.out.println(num + " is not prime");
                return false;
            }
        }
        //System.out.println(num + " is prime");
        return true;
    }

    private static long gcd(long a, long b) {
        BigInteger b1 = BigInteger.valueOf(a);
        BigInteger b2 = BigInteger.valueOf(b);
        BigInteger gcd = b1.gcd(b2);
        return gcd.longValue();
    }

    public void solveD() throws IOException {

    }

    public void solve() throws IOException {
        int t = readInt();
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < t; i++) {
            Set<Integer> deleted = new HashSet<>();
            String str = readString();
            String[] split = str.split("");
            for (int j = 1; j < split.length - 1; j++) {
                if (split[j - 1].equals("o") && split[j].equals("n") && split[j + 1].equals("e")) {
                    if (j - 2 >= 0 && split[j - 2].equals("o")) {
                        if (!deleted.contains(j)) {
                            deleted.add(j);
                        }
                    } else {
                        if (!deleted.contains(j - 1)) {
                            deleted.add(j - 1);
                        }
                    }
                }
                if (split[j - 1].equals("t") && split[j].equals("w") && split[j + 1].equals("o")) {
                    if (j + 2 < split.length && split[j + 2].equals("o")) {
                        if (!deleted.contains(j)) {
                            deleted.add(j);
                        }
                    } else {
                        if (!deleted.contains(j + 1)) {
                            deleted.add(j + 1);
                        }
                    }
                }
            }
            builder.append(deleted.size()).append("\n");
            for (Integer del : deleted) {
                builder.append(del + 1).append(" ");
            }
            builder.setLength(builder.length() - 1);
            builder.append("\n");
        }
        System.out.print(builder);
    }

    public void solveB() throws IOException {
        int t = readInt();
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < t; i++) {
            int n = readInt();
            int[] array = new int[n];
            for (int j = 0; j < n; j++) {
                array[j] = readInt();
            }
            Map<Integer, Integer> map = new HashMap<>();
            for (int j = 0; j < n; j++) {
                AbstractMap.SimpleEntry<Integer, Integer> entry = getSimple(array[j]);
                Integer key = map.get(entry.getKey());
                if (key == null) {
                    map.put(entry.getKey(), entry.getValue());
                } else {
                    if (key < entry.getValue()) {
                        map.put(entry.getKey(), entry.getValue());
                    }
                }
            }

            long res = 0;
            for (Integer value : map.values()) {
                res += value;
            }
            builder.append(res).append("\n");
        }
        System.out.print(builder);
    }

    private AbstractMap.SimpleEntry<Integer, Integer> getSimple(int z) {
        //System.out.println("z = " + z);
        int num = z;
        int q = 0;
        while (num / 2 != 0 && num % 2 == 0) {
            num = num / 2;
            q++;
        }
        //System.out.println("num = " + num);
        //System.out.println("q = " + q);
        return new AbstractMap.SimpleEntry<>(num, q);
    }

    public void solveA() throws IOException {
        int t = readInt();
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < t; i++) {
            int num = readInt();

            builder.append(checkBeautiful(num)).append("\n");
        }
        System.out.print(builder);
    }

    private int checkBeautiful(int num) {
        int res = 0;
        int numA = num;
        while (numA > 9) {
            numA = numA / 10;
            res += 9;
        }
        int form = 1;
        for (int i = 0; i < res / 9; i++) {
            form = form * 10 + 1;
        }
        //System.out.println(form);
        res += num / form;
        return res;
    }

}