Word Pattern

easy

Unknown

Question Solve Solutions

1. You are given two strings S1 and S2. S1 represents a word of length N and S2 represents N space-separated words.
2. You have to find if the words in S2 follow the exact order as characters in S1.

Note -> Every string consists of lower-case English letters only.

Input Format

Two strings S1 and S2

Output Format

true/false

Constraints

1 <= length of strings <= 1000

Example

Input

abab
pep coding pep coding

Output

true

Isomorphic Strings

Longest Subarray With Sum Divisible By K

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list