Problem:
Score : 100 points

Problem Statement

You are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.

Constraints

|S|=3

S consists of a, b and c.

Input

Input is given from Standard Input in the following format:

S

Output

If S can be obtained by permuting abc, print Yes; otherwise, print No.

Sample Input 1

bac

Sample Output 1

Yes

Swapping the first and second characters in bac results in abc.

Sample Input 2

bab

Sample Output 2

No

Sample Input 3

abc

Sample Output 3

Yes

Sample Input 4

aaa

Sample Output 4

No

Solution in Haskell (GHC 7.10.3) (judge verdict: Runtime Error)

smallAndLarge a b k
    | a + k < b - k = [a..a+(k-1)] ++ [b-(k-1)..b]
    | otherwise     = [a..b]

main :: IO ()
main = abcDo

abcDo = do
    [a, b, k] <- map read . words <$> getLine
    mapM_ print $ smallAndLarge a b k