I. Is There a Winner?
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

A group of $$$N$$$ friends has gathered to play a tournament of their favorite video game. The tournament consists of $$$K$$$ independent rounds. In each round, exactly one participant wins and receives one point. After all rounds are finished, the player with the highest score is declared champion.

Due to the group's high competitiveness, there is great uncertainty: if, at the end of the rounds, there is no unique winner because of a tie for first place between two or more people, the tournament is considered a failure and ends in sadness.

Given $$$N$$$ and $$$K$$$, your task is to determine whether the players can be sure that there will always be a unique champion, regardless of the outcome of each round, or if there is a risk that the tournament will end in a tie.

Input

A line with two integers $$$N$$$ and $$$K$$$ ($$$2 \leq N \leq 10^{9}$$$, $$$1 \leq K \leq 10^{9}$$$), the number of players and the number of rounds, respectively.

Output

A line with the character 'S' if the players are guaranteed happiness (that is, it is impossible for there to be a tie for first place), or the character 'N' if there is a risk of ending in sadness (that is, there exists at least one scenario where a tie for the maximum score occurs).

Examples
Input
2 1
Output
S
Input
3 2
Output
N
Note

In the second example, player 1 could win the first round and player 3 the second round. This situation results in a tie for first place and the tournament ends in sadness.