
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Let $S$ and $T$ be two non-empty subsets of $R$. If there exists a function $y = f(x)$ from $S$ to $T$ that satisfies the following conditions:
1. $T = \{f(x) \mid x \in S\}$;
2. For any $x\_1, x\_2 \in S$, if $x\_1 < x\_2$, then $f(x\_1) < f(x\_2)$.

Then these two sets are said to be "order-preserving isomorphic". Now, given the following 4 pairs of sets:
1. $S = \{0, 1, 2\}$, $T = \{2, 3\}$;
2. $S = N$, $T = N^*$;
3. $S = \{x \mid -1 < x < 3\}$, $T = \{x \mid -8 < x < 10\}$;
4. $S = \{x \mid 0 < x < 1\}$, $T = R$.

The sequence number of the "order-preserving isomorphic" set pairs is $\boxed{\text{answer}}$. (Write out the sequence numbers of all "order-preserving isomorphic" set pairs.)

Present the answer in LaTex format: \boxed{Your answer}
user