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 (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    if(len(Counter(S))==3):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Solution (Python):
S = list(input())
if len(set(S))==3:
  print("Yes")
else:
  print("No")

Solution (Python):
s= input()
k = sorted(s)
S = ''
for i in k:
  S += i
if S == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if len(set(s)) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
print("Yes" if len(set(S))==3 else "No")

Solution (Python):
s=input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
S = list(input())

if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print('Yes' if len(set(s)) == 3 else 'No')

Solution (Python):
s = input()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
a = 0
b = 0
c = 0
for i in range(len(s)):
    if s[i] == 'a':
        a += 1
    elif s[i] == 'b':
        b += 1
    elif s[i] == 'c':
        c += 1
if a == 1 and b == 1 and c == 1:
    print("Yes")
else:
    print("No")

Solution (Python):

S = input()
if ''.join(sorted(S)) == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print('Yes' if 'a' in s and 'b' in s and 'c' in s else 'No')

Solution (Python):
s=str(input())
list=["a","b","c"]
S=[s[0],s[1],s[2]]
S.sort()
if S==list:
  print('Yes')
else:
  print('No')

Solution (Python):
if len(set(input())) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[0]:
  print('No')
else:
  print('Yes')

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    s = ns()
    
    if set(s) == set(['a', 'b', 'c']):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):


def main():
    s = input()
    if len(set(s)) == 3:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):
print('Yes' if len(set(list(input())))==3 else 'No')

Solution (Python):
S=list(str(input()))
print('Yes' if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0] else 'No')

Solution (Python):
s = sorted(input())
if s[0]=="a" and s[1]=="b" and s[2]=="c":
  print("Yes")
else:
  print("No")

Solution (Python):
a=input()
b=list(a)
x=0
lis={"a":1,"b":5,"c":10}
for i in b:
    x=lis[i]+x
if x==16:
  print("Yes")
else:
  print("No")

Solution (Python):
s = set(input())
print(['No', 'Yes'][set('abc')==s])

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
s = input()
ca, cb, cc = 0, 0, 0
for i in range(3):
    if s[i] == 'a':
        ca += 1
    elif s[i] == 'b':
        cb += 1
    else:
        cc += 1

if ca == 1 and cb == 1 and cc == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    S = input()
    if len(set(S)) == 3:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

Solution (Python):
print('Yes' if len(set(input()))==3 else 'No')

Solution (Python):
S = input()
if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
ans = ["abc","acb","bac","bca","cab","cba"]
if S in ans:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
ans = 'Yes'
if S[0] == S[1]:
    ans = 'No'
if S[0] == S[2]:
    ans = 'No'
if S[1] == S[2]:
    ans = 'No'
print(ans)

Solution (Python):
S = list(input())
S.sort()
if S == ['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
t = sorted(s)
if t[0] == 'a' and t[1] == 'b' and t[2] == 'c':
    print("Yes")
else:
    print("No")

Solution (Python):
s =input()
print("Yes" if ("a" in s) and ("b" in s) and ("c" in s) else "No")

Solution (Python):
S = input()
if S in ["abc", "acb", "bac", "bca", "cab", "cba"]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if S.count("a") == 1 and S.count("b") == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
arr=str(input())
a = len([1 for x in arr if x=='a'])
b = len([1 for x in arr if x=='b'])
c = len([1 for x in arr if x=='c'])
if a==1 and b==1 and c==1:
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print('Yes' if len(set(s)) == 3 else 'No')

Solution (Python):
S = input()
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

print("Yes" if len(set(s))==3 else "No")

Solution (Python):
print("Yes" if len(set(input())) == 3 else "No")

Solution (Python):
a=input()
if len(set(a))==3:
    print("Yes")
else:
    print("No")

Solution (Python):
S=list(input())
S2 = set(S)
abc = {"a","b","c"}
if S2 == abc:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s.count("a") == 1 and s.count("b") == 1 and s.count("c") ==1:
  print("Yes")
else:
  print("No")

Solution (Python):
N = sorted(list(input()))

if N == ["a","b","c"]:
  print("Yes")
  
else:
  print("No")

Solution (Python):
s = input()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())

if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(input())
b=list("abc")
a.sort()
if a==b:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if 'a' in s and 'b' in s and 'c' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    s = IS()
    if 'a' in s and 'b' in s and 'c' in s: print('Yes')
    else: print('No')

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
if "a" in S and "b" in S and "c" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
a = s.count('a')
b = s.count('b')
if a == b == 1:
  print('Yes')
else:
  print('No')

Solution (Python):
s = str(input())
a = s.count('a')
b = s.count('b')
if a == b ==  1:
  print('Yes')
else:
  print('No')

Solution (Python):
s = str(input())
a = s.count('a')
b = s.count('b')
c = s.count('c')
if a == b == c == 1:
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):
N=input()
A=len(set(N))
print("Yes" if A ==3 else "No")

Solution (Python):

url = "https://atcoder.jp//contests/abc093/tasks/abc093_a"

def main():
    t = input()
    alp = ['a', 'b', 'c']
    for a in alp:
        if a in t:
            pass
        else:
            print('No')
            exit()
    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
s=input()
print('Yes' if s.count('a')==s.count('b')==s.count('c')==1 else 'No')

Solution (Python):
s = input()

s = set(s)

if len(s) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
l = []
for i in range(len(s)):
    l.append(s[i])
print('Yes' if 'abc'==''.join(sorted(l)) else 'No')

Solution (Python):
def resolve():
    S = input()
    print("Yes" if S.count("a") == 1 and S.count("b") == 1 and S.count("c") == 1 else "No")

if '__main__' == __name__:
    resolve()

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    s = iss()
    print('Yes' if len(set(s)) == 3 else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
s=input()
print("Yes" if s.count("a")==s.count("b")==s.count("c")==1 else "No")

Solution (Python):
S = input()
print('Yes' if len(set(S)) == 3 else 'No')

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
S=input()
if sorted(S)==["a","b","c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
x=0
y=0
z=0
for i in range(len(s)):
    if s[i]=="a":
        x+=1
    elif s[i]=="b":
        y+=1
    else:
        z+=1

if x==y==z:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s=="abc" or s=="acb" or s=="bac" or s=="bca" or s=="cab" or s=="cba":
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
print("Yes" if len(set(S))==3 else "No")

Solution (Python):
S = input()
if 'a' in S and'b' in S and 'c' in S:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
if 'a' in(s) and 'b' in(s) and 'c' in(s):
  print('Yes')
else:
  print('No')

Solution (Python):
S = str(input())

if "a" in S and "b" in S and "c" in S and len(S) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

for i in "abc":
    if S.count(i) != 1:
        print('No')
        exit()
        
print('Yes')

Solution (Python):
S = input()
S = [s for s in S]
if len(set(S))==3:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Solution (Python):
n = list(input())
if n.count('a')==1 and n.count('b')==1:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
 
if "a" in S and "b" in S and "c" in S:
    print("Yes")
else :
    print("No")

Solution (Python):
S = input()
if (S[0] != S[1]) and (S[1] != S[2]) and (S[0] != S[2]):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
t = set(s)
if len(t) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
print("YNeos"[len(set(input()))!=3::2])

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
moji=list(input())
moji.sort()
a="".join(moji)

if a=="abc":
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if S.count("a") == 1 and S.count("b") == 1 and S.count("c"):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s.count('a') and s.count('b') and s.count('c'):
  print('Yes')
else:
  print('No')

Solution (Python):
S = list(input())
S = ''.join(sorted(S))
print('Yes' if S == 'abc' else 'No')

Solution (Python):
S = input()

if "a" in S and "b" in S and "c" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
print('Yes') if s.count('a') and s.count('b') and s.count('c') else print('No')

Solution (Python):
s = list(input())

if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if len(set(s)) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
list = ['a','b','c']
if S[0] in list:
    list.remove(S[0])
    if S[1] in list:
        list.remove(S[1])
        if S[2] in list:
            print('Yes')
        else:
            print('No')
    else:
        print('No')
else:
    print('No')

Solution (Python):
s=input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):
s = input()
ss = "".join(sorted(s))
if ss == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0]:
  print('Yes')
else:
  print('No')

Solution (Python):
if sorted(input())==['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Solution (Python):

s = input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s=="abc" or s=="acb" or s=="bac" or s== "bca" or s=="cba" or s=="cab":
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
s_list = list(s)
s_list.sort()
s = "".join(s_list)
print("Yes" if s == "abc" else "No")

Solution (Python):
s = input()
a = list(s)
if len(a) == 3 and a.count("a") == 1 and a.count("b") == 1 and a.count("c") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
S = set(input())
if set('abc') == S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
L = [s[0], s[1], s[2]]
L.sort()
S = "".join(L)
print("Yes") if S == "abc" else print("No")

Solution (Python):
def main():
    S = input()

    if 'a' in S and 'b' in S and 'c' in S:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
s=input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
S=input()
string="a","b","c"
if (S[0] != S[1]) and (S[1] != S[2]) and (S[0] != S[2]):
    print("Yes")
else:
    print("No")

Solution (Python):
s=set(input())
print(["No","Yes"][len(s)==3])

Solution (Python):
a=set(input())
print("Yes" if len(a)==3 else "No")

Solution (Python):
s = input()
s = sorted(s)

if ''.join(s) == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
abc = sorted(list(input()))
if "".join(abc)=="abc":
    print("Yes")
else:
    print("No")

Solution (Python):
import itertools
def main():
  s = input()
  ans = False
  if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1:
    ans = True
  print("Yes" if ans else "No")
if __name__ == '__main__':
  main()

Solution (Python):
s = str(input())

if (s =='abc' or s == 'acb' or s == 'bac' or s == 'bca' or s == 'cab' or s == 'cba'):
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
count = 0
if "a" in n and "b" in n and "c" in n:
  print("Yes")
else:
  print("No")

Solution (Python):
s = list(input())
print("Yes" if "a" in s and "b" in s and "c" in s else "No")

Solution (Python):
S = input()
if S == "abc" or S == "acb" or S == "bac" or S == "bca" or S == "cab" or S == "cba": print("Yes")
else: print("No")

Solution (Python):

S = input()

if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = set(input())
if len(s) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = str(input())
s = sorted(s)
s = ''.join(s)
if s == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print("Yes" if len(set(s)) == 3 else "No")

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()
s = ''.join(sorted(s))

def main():
    ans = 'Yes' if s == 'abc' else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):

s = input()
print('Yes' if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1 else 'No')

Solution (Python):
s = input()
s = sorted(s)
s = "".join(s)

if s == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
ans = len(set(input()))
if ans == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
s = sorted(s)
s = "".join(s)

if s == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
l = []
m = ["a", "b", "c"]
ans = "Yes"

for i in range(3):
    l.append(s[i])

l = sorted(l)

for i in range(3):
    if l[i] != m[i]:
        ans = "No"

print(ans)

Solution (Python):
S = input()

if (S[0]== "a" or S[1] == "a" or S[2] == "a") and (S[0]== "b" or S[1] == "b" or S[2] == "b") and (S[0] == "c" or S[1] == "c" or S[2] == "c") :
	print("Yes")
else:
	print("No")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = input()
    b = []
    for i in a:
        b.append(i)

    aset = set(b)

    if len(aset) ==3:
        print("Yes")
    else:
        print("No")

Solution (Python):
if ''.join(sorted(input())) == 'abc':
  print('Yes')
else:
  print('No')

Solution (Python):
import math

a=input()
a=sorted(a)
print("Yes" if a==["a","b","c"] else "No")

Solution (Python):
s= input()
if len(set(s))==3:print('Yes')
else:print('No')

Solution (Python):
S=input()
line=set(S)
if len(line)==3:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
print('Yes' if ('a' in S) == True and ('b' in S) == True and ('c' in S) == True else 'No')

Solution (Python):
S=str(input())
if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if ( S[0]!=S[1]) and ( S[1]!=S[2]) and ( S[2]!=S[0]):
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
S = input()
if all(S.count(c) for c in "abc"):
  print("Yes")
else:
  print("No")

Solution (Python):
print('YNeos'[len(set(list(input())))!=3::2])

Solution (Python):
S = input()
if S=='abc' or S=='acb' or S=='bac' or S=='bca' or S=='cab' or S=='cba':
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if ''.join(sorted(s)) == 'abc':
  print('Yes')
else:
  print('No')

Solution (Python):
S = list(input())
S.sort()
a = "".join(S)
print("Yes" if a == "abc" else "No")

Solution (Python):
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S = input()
print('Yes' if 'a' in S and 'b' in S and 'c' in S else 'No')

Solution (Python):
s = input()
if s == "abc" or s == "acb" or s == "bac" or s == "bca" or s == "cab" or s == "cba":
  print("Yes")
else:
  print("No")

Solution (Python):
x=input()
x=list(x)
x.sort()
if x[0]=='a' and x[1]=='b' and x[2]=='c':
	print('Yes')
else:
	print('No')

Solution (Python):
s=list(input())
s.sort()
if s==["a","b","c"]:
        print("Yes")
else:
        print("No")

Solution (Python):
s = input()
s = sorted(s)

if s == ['a', 'b', 'c']:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Solution (Python):
S=input()

if S=="abc" or S=="acb" or S=="bac" or S=="bca" or S=="cab" or S=="cba":
  print("Yes")
else:
  print("No")

Solution (Python):
s=str(input())
S=set(s)
if len(S)==3:
  print('Yes')
else:
  print('No')

Solution (Python):
def main():
    s = list(input())
    s_num = len(set(s))
    if s_num == 3:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
C = ['a', 'b', 'c']
ans = 'Yes' if all(x in S for x in C) else 'No'

print(ans)

Solution (Python):
s = input()

l = list(s)
l.sort()
if (l == ["a", "b", "c"]):
    print("Yes")
else:
    print("No")

Solution (Python):
ss=input()

d={"a":0,"b":0,"c":0}

for s in ss:
  d[s]+=1

if d["a"]==1 and d["b"]==1 and d["c"]==1:
  print("Yes")
else:
  print("No")

Solution (Python):
def abc_of_ABC(s):

    return "Yes" if s.count("a") == 1 and s.count("b") == 1 else "No"

def main():
    s = str(input())
    print(abc_of_ABC(s))

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

if (s == 'abc' or s == 'acb' or s == 'bac' 
or s == 'bca' or s == 'cba' or s == 'cab'):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[0]==s[1] or s[1]==s[2] or s[2]==s[0]:
  print('No')
else:
  print('Yes')

Solution (Python):
print("Yes" if ''.join(sorted(input())) == "abc" else "No")

Solution (Python):
list_s = list(input())
if len(list_s) == 3 and list_s.count('a') == 1 and list_s.count('b') == 1 and list_s.count('c') == 1 :
    print("Yes")
else:
    print('No')

Solution (Python):
s = input()
s = sorted([s[0], s[1], s[2]])
s = ''.join(s)

if s=='abc':
    print('Yes')
else:
    print('No')

Solution (Python):
l = input()
if "a" in l and "b" in l and "c" in l:
  print("Yes")
else:
  print("No")

Solution (Python):
a = input()
if a.count('a')==1 and a.count('b') and a.count('c'):
  print('Yes')
else:
  print('No')

Solution (Python):

a = sorted(input())
print('Yes' if a == ['a' , 'b' , 'c'] else 'No')

Solution (Python):

a = input()
a = ''.join(sorted(a))
print('Yes' if a == 'abc' else 'No')

Solution (Python):
s=input()

print("Yes"if ("a" in s) and ("b" in s) and ("c" in s) else"No")

Solution (Python):
s = input()

if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = sorted(input())
print("Yes" if s==["a", "b", "c"] else "No")

Solution (Python):
S=input()
t=[a for a in S]
u=sorted(t)
if u[0]=='a' and u[1]=='b' and u[2]=='c':
    print('Yes')
else:
    print('No')

Solution (Python):
Ss = input()

if set(Ss) == set('abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
print("Yes" if "".join(sorted(input())) == "abc" else "No")

Solution (Python):
s = list(input())
s.sort()
if 'abc' == ''.join(s):
    print('Yes')
else:
    print('No')

Solution (Python):
s=list(input())
s.sort()

if s[0]=="a" and s[1]=="b" and s[2]=="c":
    print("Yes")
else:
    print("No")

Solution (Python):

s=input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
if a[1]!=a[2] and a[2]!=a[0] and a[0]!=a[1]:
    print("Yes")
else:
    print("No")

Solution (Python):

def main():
    import sys
    
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations, permutations
    
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    

    

    S = input().rstrip()
    if len(set(S))==3:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

from collections import Counter

S = ns()
N = len(S)

c = Counter(S)
print("Yes" if len(c) == N else "No")

Solution (Python):
print ("Yes" if len(set(input()))==3 else "No")

Solution (Python):
s = list(input())
s.sort()
s = s[0]+s[1]+s[2]


if s == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if len(set(s)) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if len(set(s))==3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = list(input())
s.sort()
if s == ["a", "b", "c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

s = set(S)
if len(s) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):

s=input()
s1=set(list(s))
if len(s1)==3:
    print("Yes")
else:
    print("No")

Solution (Python):
a = ['a','b','c']
s = list(input())
s.sort()
print('Yes' if a == s else 'No')

Solution (Python):
n = set(input())
print('Yes' if len(n)==3 else 'No')

Solution (Python):
s=input()
a=0
b=0
c=0
for i in range(3):
    if s[i]=="a":
        a+=1
    elif s[i]=="b":
        b+=1
    elif s[i]=="c":
        c+=1
if a==1 and b==1 and c==1:
    print("Yes")
else:
    print("No")

Solution (Python):
if len(set(input())) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
A = input()
listA = ["abc","acb","bac","bca","cab","cba"]
if A in listA:
    print("Yes")
else:
    print("No")

Solution (Python):
s=sorted(input())
res = "".join(s)
print("Yes" if res == "abc" else "No")

Solution (Python):
s = input()

if s.count("a") == s.count("b") == s.count("c") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if len(set(s)) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
s.sort()
if s==['a','b','c']:
  print("Yes")
else :
  print("No")

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
print("YNeos"[''.join(sorted(input()))!="abc"::2])

Solution (Python):
print("YNeos"[not ''.join(sorted(input()))=="abc"::2])

Solution (Python):
if len(set(list(input())))==3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if all(i in s for i in 'abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
print('Yes' if len(set(input())) == 3 else 'No')

Solution (Python):
a = sorted(list(input()))
print("Yes" if a == ["a","b","c"] else "No")

Solution (Python):
s = list(input())
abc = ['a', 'b', 'c']
s.sort()
if abc == s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
s.sort()
if s[0] == "a" and s[1] == "b" and s[2] == "c":
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):


S = list(input())

if sorted(list(set(S))) == ['a','b','c']:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
print('Yes') if S.count('a')==1 and S.count('b')==1 and S.count('c')==1 else print('No')

Solution (Python):
s = input()
print("Yes" if len(set(s)) == 3 else "No")

Solution (Python):

s=input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
s = input()
print('Yes' if len(set(s))==3 else 'No')

Solution (Python):
s = input()
if 'a' in s and 'b' in s and 'c' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input().strip()

s_set=set(s)
print("Yes" if len(s_set)==3 else "No")

Solution (Python):
S = input()
if "a" in S and "b" in S and "c" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

answer = "Yes"
for c in "abc":
  if c not in s:
    answer = "No"
print(answer)

Solution (Python):
print("Yes" if len(set([i for i in list(input()) if i in ["a", "b", "c"]])) == 3 else "No")

Solution (Python):
s=input()
b=''.join(sorted(s))
if b=="abc":
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
if 'a' in S and 'b' in S and 'c' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
if 'a' in S and 'b' in S and 'c' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
print("No" if len(set(input()))!=3 else "Yes")

Solution (Python):
s = str(input())
if ("a" in s) and("b" in s) and ("c" in s):
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if 'abc' == ''.join(sorted(s)):
    print('Yes')
else:
    print('No')

Solution (Python):
S=set(input())

if len(S)==3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = raw_input()
if 'a' in s and 'b' in s and 'c' in s:
    print 'Yes'
else:
    print 'No'

Solution (Python):
s=raw_input()
sa=0
sb=0
sc=0
for i in range(len(s)):
  if s[i]=="a":
    sa+=1
  if s[i]=="b":
    sb+=1
  if s[i]=="c":
    sc+=1
if sa==1 and sb==1 and sc==1:
    print "Yes"
else: 
    print "No"

Solution (Python):
S=list(input())
S.sort()
if S==["a","b","c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
S = set(s)
if len(S) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

a = 0
b = 0
c = 0

for i in range(3):
	if (a == 0 and S[i] == 'a'):
		a = 1
	elif (b == 0 and S[i] == 'b'):
		b = 1
	elif (c == 0 and S[i] == 'c'):
		c = 1

if (a == 1 and b == 1 and c == 1):
	print("Yes")
else:
	print("No")

Solution (Python):
s = set(input())
if len(s) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
if "".join(sorted(input()))=="abc":
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S[0] != S[1] and S[1] != S[2] and S[0] != S[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = str(input())
 
if 'a' in s and 'b' in s and 'c' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
S = set(input())

if len(S) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
S = str(input())

if ('a' in S) & ('b' in S) & ('c' in S):
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
if len(set(a)) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if len(set(s)) == 3:
    print('Yes')
else:
    print('No')