CF1276A.As Simple as One and Two

You are given a non-empty string $s=s_1s_2\dots 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 \le j \le 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?

给你一个非空字符串 $s=s_1s_2\dots s_n$，该字符串仅由小写拉丁字母组成。如果字符串中至少包含一个子串 "one" 或 至少包含一个子串 "two"（或两者同时存在），则 Polycarp 不喜欢该字符串。换言之，若存在整数 $j$（满足 $1 \le j \le n-2$），使得 $s_{j}s_{j+1}s_{j+2}=$"one" 或 $s_{j}s_{j+1}s_{j+2}=$"two"，则 Polycarp 不喜欢字符串 $s$。

例如：

• Polycarp 不喜欢字符串 "oneee"、"ontwow"、"twone" 和 "oneonetwo"（它们均至少含有一个子串 "one" 或 "two"）；
• Polycarp 喜欢字符串 "oonnee"、"twwwo" 和 "twnoe"（它们均不包含子串 "one" 和 "two"）。

Polycarp 想选定一组下标（位置），并同时删除这些位置上的所有字符。

例如，若字符串为 $s=$"onetwone"，且 Polycarp 选定了下标 $3$ 和 $6$，则从 "onetwone" 中删除对应字符后得到的结果为 "ontwne"。

问：Polycarp 至少需要选定多少个下标（位置）才能使字符串变为他所喜欢的？这些位置应是哪些？

The first line of the input contains an integer $t$ ($1 \le t \le 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\cdot10^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\cdot10^6$.

输入的第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 表示输入中测试用例的数量。接下来是各测试用例。

每个测试用例由一个非空字符串 $s$ 组成，其长度不超过 $1.5\cdot10^5$。字符串 $s$ 仅由小写拉丁字母组成。

保证所有测试用例中字符串总长度之和不超过 $1.5\cdot10^6$。

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 \le r \le |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.

按输入中测试用例出现的顺序，为每个测试用例输出一个答案。

每个答案的第一行应包含 $r$（$0 \le r \le |s|$）—— 所需删除的最少位置数，其中 $|s|$ 是给定字符串的长度。
每个答案的第二行应包含 $r$ 个互不相同的整数 —— 待删除位置的下标（顺序任意）。下标从左到右编号，范围为 $1$ 到字符串长度。
若 $r = 0$，则可跳过第二行（或输出空行）。
若存在多个合法答案，输出任意一个即可。

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".

在第一个例子中，答案为：

• “onetwone”，
• “testme”——Polycarp 喜欢它，无需删除任何字符，
• “oneoneone”，
• “twotwo”。

在第二个例子中，答案为：

• “onetwonetwooneooonetwooo”，
• “two”，
• “one”，
• “twooooo”，
• “ttttwo”，
• “ttwwoo”——Polycarp 喜欢它，无需删除任何字符，
• “ooone”，
• “onnne”——Polycarp 喜欢它，无需删除任何字符，
• “oneeeee”，
• “oneeeeeeetwooooo”。