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):
s = input()
d = {}
for i in range(len(s)):
    if s[i] not in d:
        d[s[i]] = 1
print("Yes" if len(d) == 3 else "No")

Solution (Python):
s1, s2, s3 = input()
li = [s1, s2, s3]
li.sort()
if li == ["a", "b", "c"]:
    print("Yes")
else:
    print("No")

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

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

if 'a' in S and 'b' in S and 'c' in S:
    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):
s = set(list(input()))

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

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

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

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

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

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

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

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

Solution (Python):
S = set(input())
if len(S)==3:
  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.count('a') == S.count('b') == S.count('c'):
    print("Yes")
else:
    print("No")

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

Solution (Python):
a=input()
ac,bc,cc=0,0,0
for i in range(3):
    if a[i]=='a':
        ac+=1
    if a[i]=='b':
        bc+=1
    if a[i]=='c':
        cc+=1
if ac==1 and bc==1 and cc==1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = str(input())
a = {"a","b","c"}
if set(s) == a:
  print("Yes")
else:
  print("No")

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

Solution (Python):
print('Yes' if sorted(input()) == list('abc') else '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 = input()
print("Yes" if "a" in S and "b" in S and "c" in S else "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()
S="".join(sorted(list(S)))
if S == '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):
moji = list(input())
moji.sort()
m = ''.join(moji) 
if m == 'abc':
  print('Yes')
else:
  print('No')

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

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

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

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

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

Solution (Python):
import sys
 
s = [0,0,0]
t = input()
for i in t:
  s[ord(i)-97]+=1
for i in s:
  if(i!=1):
    print('No')
    sys.exit()
print('Yes')

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

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

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

if S==["a","b","c"]:
  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 sys

s = [0,0,0]
t = input()
for i in t:
  s[ord(i)-97]+=1
for i in s:
  if(i!=1):
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
string=input()
list=["a","b","c"]

list.remove(string[0])
try:
  list.remove(string[1])
  try:
    list.remove(string[2])
    print("Yes")
  except:
    print("No")
except:
  print("No")

Solution (Python):
import sys

s = [0,0,0]
t = input()
for i in t:
  s[ord(i)-97]+=1
for i in s:
  if(i!=1):
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
S = input()

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

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

Solution (Python):
import sys




def main():
	s = input()
	
	for c in 'abc':
		if c not in s:
			print('No')
			return 
	print('Yes')
	


if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
	else:
		input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
a = [c for c in input()]
a.sort()
a = ''.join(a)
print('Yes' if a == 'abc' else '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 = list(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()
st = set()

for i in s:
    st.add(i)

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

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

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

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

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

Solution (Python):
print('YNeos'[set(map(str,input()))!={'a','b','c'}::2])

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    s = S()
    s.sort()
    if s == ["a", "b", "c"]:
        print("Yes")
    else:
        print("No")
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):
s = input()

print('Yes' if 'abc' == ''.join(sorted(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):
print("Yes" if {c for c in input()} == {"a", "b", "c"} else "No")

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

Solution (Python):
a = input()
b = [a[i] for i in range(len(a))]
b.sort()
if b[0] == "a" and b[1] == "b" and b[2] == "c":
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import numpy as np
import statistics
from statistics import mean, median,variance,stdev
import math

def main():
	S = input()
	
	ans = [-1 for _ in range(3)]
	
	for i in range(3):
		if S[i] == "a":
			ans[0] = 1
		elif S[i] == "b":
			ans[1] = 1
		elif S[i] == "c":
			ans[2] = 1
	
	if ans[0] == ans[1] == ans[2] == 1:
		print("Yes")
	else:
		print("No")
			
	
if __name__ == "__main__":
	main()

Solution (Python):
wordlist = ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
S = input()
if S in wordlist:
	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):



s = list(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")==1 and s.count("b")==1 and s.count("c")==1 else "No")

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

Solution (Python):
S = input()
d = {}
for s in S:
    d[s] = True

if "a" in d and "b" in d and "c" in d:
    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()


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


print(ans)

Solution (Python):
s=input()
A=s.count("a")
B=s.count("b")
C=s.count("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):
a = input()
b = sorted(a)

if "".join(b) == "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):
s=input()
flag=0
if s == "abc":
  flag=1
elif s == "acb":
  flag=1
elif s == "bac":
  flag=1
elif s == "bca":
  flag=1
elif s == "cab":
  flag=1
elif s == "cba":
  flag=1
  
if flag:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    s = input()

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

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

resolve()

Solution (Python):

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

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

Solution (Python):
a=input()
print('Yes' if all(a.count(t)>0 for t in 'abc') else 'No')

Solution (Python):
S = input()
result = 0
for x in ['a','b','c']:
  if x in S:
    result+=1
print('Yes' if result==3 else 'No')

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

Solution (Python):
s = input()
a = s.count("a")
b = s.count("b")

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

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

Solution (Python):
s = input()
print('Yes' if s.count('a') and s.count('b') and s.count('c') 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):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    S = list(_ for _ in input())
    S.sort()
    S = ''.join(S)
    if S == 'abc':        
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()
S = ''.join(sorted(S))

if S == '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):

S = input()

a = 0
b = 0
c = 0
o = 0

for i in S:

    if i == "a":
        a += 1


    elif i == "b":
        b += 1


    elif i == "c":
        c += 1

    else:
        o += 1

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

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

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

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

Solution (Python):
s = set(str(input()))
if s == set("abc"):
    print("Yes")
else:
    print("No")

Solution (Python):
s = set(input())
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):
print('Yes' if len(set(input())) == 3 else 'No')

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

Solution (Python):

s = input()
s = "".join(sorted(s))

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

Solution (Python):
list1=list(input())
if set(list1)=={"a","b","c"}:
  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):
a,b,c=input()
L=sorted([a,b,c])
if L[0]+L[1]+L[2]=='abc':
  print('Yes')
else:
  print('No')

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

check = [0, 0, 0]
for i in range(3):
    if S[i] == 'a':
        check[0] = 1
    if S[i] == 'b':
        check[1] = 1
    if S[i] == 'c':
        check[2] = 1

if sum(check) == 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()
if len(set(s)) == 3:
  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 not(S[0] == S[1]) and not(S[1] == S[2]) and not(S[0] == S[2]):
    print("Yes")
else:
    print("No")

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

Solution (Python):
def abc():
    S = input().rstrip()
    print('Yes' if set(S) == {'a', 'b', 'c'} else 'No')


abc()

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):
S = input()
if S.count("a") == 1 and S.count("b") == 1 and S.count("c") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):


def solve():
    s = input()
    if 'a' in s and 'b' in s and 'c' in s:
        return 'Yes'
    return 'No'

print(solve())

Solution (Python):
a = input()

if 'a' in a and 'b' in a and 'c' in a:
    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 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):
s=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 :
        print('Yes')
else :
        print('No')

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

Solution (Python):
s = ''.join(sorted(list(input().rstrip())))
if 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 = input()
l = ['a','b','c']
for c in s:
  if c in l:
    l.remove(c)
print('Yes' if l ==[] else 'No')

Solution (Python):
S=input()
a=0
b=0
c=0
for s in S:
  if s=='a':
    a=1
  elif s=='b':
    b=1
  elif s=='c':
    c=1
if a==1 and b==1 and c==1:
  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()
x=s.count('a')
y=s.count('b')
z=s.count('c')
if x==1 and y==1 and z==1:
  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):
S = 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):
s = input()
if s.count("a") == 1 and s.count("b") == 1:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
s = list(input())
if len(set(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()
li = []

for i in s:
    li.append(i)

if len(set(li)) < 3:
    print("No")

else:
    print("Yes")

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

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

Solution (Python):
s = input()

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

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

import sys

YES = "Yes"  
NO = "No"  

def solve(S: str):
    print(YES if len(set(S)) == 3 else NO)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
S = list(input())
S.sort()
a = ''.join(S)
if a == '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):
a=input()
if a.find("a")>=0and a.find("b")>=0and a.find("c")>=0:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(S: str):
    s = list(S)
    s.sort()
    if ''.join(s) == 'abc':
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()
S_list = [S[0], S[1], S[2]]
print("Yes" if (len(set(S_list)) == 3) else "No")

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

Solution (Python):


from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)





def main():
    s = input()

    ss = [c for c in s]
    ss.sort()

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


if __name__ == '__main__':
    main()

Solution (Python):
a = list(input())
a.sort(reverse=False)

if ''.join(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") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
list = []
d = ["a" , "b" , "c"]

for i in S:
    list.append(i)
list.sort()

if list == d:
    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):
n = list(set(list(input())))
n.sort()
if 'abc' == ''.join(n):
  print("Yes")
else:
  print("No")

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

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

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

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

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

Solution (Python):
s = input()
if "".join(sorted(s)) == "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()

dic = {'a': False, 'b':False, 'c':False}

for i in range(len(S)):
    if S[i] in dic.keys():
        dic[S[i]] = True

if False not in dic.values():
    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):
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.count("a")==1 and s.count("b")==1 and s.count("c")==1:
    print("Yes")
else:
    print("No")

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

Solution (Python):
s = input()
ans = 0
for c in s:
  if c == "a":
    ans |= 1
  elif c == "b":
    ans |= 2
  else:
    ans |= 4
if(ans == 7):
  print("Yes")
else:
  print("No")

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

Solution (Python):

import bisect





def main():
    a = list(input())
    if a[0] != a[1] and a[1] != a[2] and a[0] != a[2]:
        print('Yes')
    else:
        print('No')







if __name__ == '__main__':
    main()

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

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

Solution (Python):
s=input()

m=sorted(s)
k=''.join(m)

if k=="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()
isA = 0
isB = 0
isC = 0
for i in S:
    if i == 'a':
        isA += 1
    if i == 'b':
        isB += 1
    if i == 'c':
        isC += 1
if isA == 1 and isB == 1 and isC == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print("Yes"if ''.join(sorted(s))=="abc" else "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):
import sys


def input():
    return sys.stdin.readline()[:-1]








a = str(input())
b = ["abc", "acb", "bac", "bca", "cab", "cba"]
if a in b:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

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

Solution (Python):
print('Yes' if sorted(input())==list('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") == 1 and S.count("b") == 1 and S.count("c") == 1 else "No")

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):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()
    s = set(s)


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

solve()

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.count("a") >= 1 and s.count("b") >= 1 and s.count("c") >= 1:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
s = str(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 S in ['abc','bac','acb','bca','cab','cba']:
    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):
S=list(input())
if len(set(S))==3:
	print('Yes')
else:
	print('No')

Solution (Python):
s = input()
cnt = 0
for i in range(3):
    if s[i] == "a":
        cnt += 1
    elif s[i] == "b":
        cnt += 2
    elif s[i] == "c":
        cnt += 4

if cnt == 7:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

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

Solution (Python):
s=input()
flag=[0,0,0]
n=False
for i in s:
	i=ord(i)-97
	if(flag[i]==1):
		n=True
	else:
		flag[i]=1

if n:
	print('No')
else:
	print('Yes')

Solution (Python):


def read_input():
    s = input()
    return s

def submit():
    s = read_input()
    s = [c for c in s]
    s.sort()
    s = ''.join(s)

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

if __name__ == '__main__':
    submit()

Solution (Python):
s = input()
if s.find("a")!=-1 and s.find("b")!=-1 and s.find("c")!=-1:
  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=sorted(list(input()))
print("Yes" if s==['a','b','c'] else "No")

Solution (Python):
s = input()
ans = 0

if s.count('a') == 1:
  ans += 1
if s.count('b') == 1:
  ans += 1
if s.count('c') == 1:
  ans += 1

if ans == 3:
  print('Yes')
else:
  print('No')

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

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

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