Scientists are constantly listening for aliens. Because of the great distances, some things may come more delayed than others. Thus they need an algorithm that when given two strings, ~a~, and ~b~ ~(2 \leq |a|, |b| \leq 1000~, where ~|a| = |b|)~, determines whether it is possible to make ~b~ by taking a single substring of ~a~ and moving it to another index. It should also detect aliens when the two strings are the same.
Note: The constraints and data have changed from the contest problem.
The input will consist of two newline separated strings, ~a~ and ~b~. Each string will only consist of lowercase letters.
aliens if it is possible, else
Sample Input 1
Sample Output 1
Explanation for Sample 1
f was moved to after index ~3~ (starting with ~1~).
Sample Input 2
Sample Output 2
Explanation for Sample 2
There is no single substring that can be moved to create the new string.