Garamana

An anagram of a word is a rearrangement of the letters of the word. For example,

1. "taro" is an anagram of "rato";
2. "roma" is an anagram of "amor"; and
3. the anagrams of "aab" are "aab", "aba", and "baa".

A wildcard anagram of a word is an anagram where some of the letters may have been replaced by the character '*' (asterisk). For example, three possible wildcard anagrams of "roma" are "*oma", "r*ma", and "ro*a".

Given two words, write a program to determine if the second word is a wildcard anagram of the first word.

Input

The first line of the input contains $P$, the first word. The second line contains $A$, the second word.

Output

Your program should produce a single line, containing a single character, which should be 'S' if $A$ is a wildcard anagram of $P$, or 'N' otherwise.

Constraints

• $1 \leq$ length of $P \leq 100$
• length of $A$ = length of $P$
• $P$ is composed of unaccented lowercase letters
• $A$ is composed of unaccented lowercase letters and the character '*' (asterisk)

Scoring Information

• For a set of test cases worth 50 points, $A$ contains only unaccented lowercase letters.