String subsequence

You are given two strings $s$ and $t$ with respective lengths $m$ and $n$ . Tell if $s$ is a subsequence of $t$ , that is, if there is a subset of $m$ positions of $t$ , $0 \le j_0 < \dots < j_{m-1} < n$ , such that $s[i] = t[j_i]$ for all $0 \le i < m$ . Additionally, tell if there is just one such subset of positions.

Input

Input consists of several cases, each with $s$ and $t$ . You can assume $1 \le \vert s \vert \le \vert t \vert \le 10^5$ , and that the words are made up of only digits and lowercase and uppercase letters.

Output

For every case, tell if there are zero solutions, just one solution, or multiple solutions.

Problem information

Author: Salvador Roura

Generation: 2026-01-25T11:02:09.898Z