The council of the terraced vines of Grapehollow pays by the answer, and Uma intends to earn it. First: the full register of letters. Task: Print YES if s is a subsequence of t (its characters appear in t in order, not necessarily contiguously), otherwise NO. Input format: Two lines: string s, then string t. Output format: Print YES or NO. Constraints: 1 <= |s|,|t| <= 41321; lowercase letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s|,|t| <= 41321; lowercase letters.
