Subsequence Checker

Given two strings s₁ and s₂, determine whether s₂ is a subsequence of s₁.

A string s₂ is a subsequence of s₁ if there exists a sequence of indices $$1 \le i_1 < i_2 < \cdots < i_k \le n$$ such that $$s_{2}[j] = s_{1}[i_j]$$ for all (1 \le j \le k). In other words, all characters of s₂ appear in s₁ in the same order, though not necessarily contiguously.

Your task is to implement a function that reads two strings from standard input and prints "True" if the second string is a subsequence of the first, or "False" otherwise.

inputFormat

The input consists of two lines read from standard input:

1. The first line contains the string s₁.
2. The second line contains the string s₂.

Note: s₂ can be an empty string.

outputFormat

Output a single line to standard output containing either "True" if s₂ is a subsequence of s₁, or "False" otherwise.## sample

abcde
ace

True