Problem

Given two strings, str$\_$a and str$\_$b$,$ determine whether any anagram of str$\_$b$,$ occurs as a substring of str$\_$a$.$

Constraints

Comparison is NOT case sensitive and input string sizes vary

Examples

Here come dots and lines that helped build America, The Morse Code $$ True

crowd, word $$ True

There is no anagram here, some word $$ False

There is no anagram here, game $$ False

Explanations:

TRUE $=$ Some arrangement of the characters in str$\_$b is a substring in string a

FALSE $=$ Some arrangement of the characters in stb$\_$b is NOT a substring in string #a$.$ No re$-$arrangements of characters in str$\_$b are contiguously found in str$\_$a$.$