K. Keyboard
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Colin enjoys chatting with Eva online, but typing on a traditional keyboard feels too tiring. He therefore buys a new keyboard, shown below, with only the two keys he really needs: Copy and Paste.

Colin's new keyboard.

Suppose that the string $$$S$$$ is currently displayed on the screen. The keys behave as follows (note that this differs from a regular keyboard):

  • Pressing Copy replaces the string stored in memory, denoted by $$$T$$$, with the entire current string $$$S$$$.
  • Pressing Paste appends $$$T$$$ to the current string, so the displayed string becomes $$$S+T$$$. Before the first Copy operation, $$$T$$$ is the empty string.

Even this keyboard requires too much thought, so Colin decides to press the two keys alternately. If he performs any operations, the first one must be Copy, the second Paste, the third Copy, and so on. He may stop after any operation.

Initially, the screen displays $$$S_1$$$ and $$$T$$$ is empty. Can Colin obtain the target string $$$S_2$$$ by following the rule above?

Input

The first line contains a string $$$S_1$$$ ($$$1\le |S_1|\le 2\times 10^5$$$) consisting of lowercase English letters: the string initially displayed on the screen.

The second line contains a string $$$S_2$$$ ($$$1\le |S_2|\le 2\times 10^5$$$) consisting of lowercase English letters: Colin's target string.

Output

If Colin can obtain the target string, output "Smart People's Big Win!" (without quotation marks).

Otherwise, output "Lazy Dog's Great Failure..." (without quotation marks).

Examples
Input
colin
colinloveseva
Output
Lazy Dog's Great Failure...
Input
heihei
heiheiheihei
Output
Smart People's Big Win!