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=list(input())
if "a" in s:
    if "b" in s:
        if "c" in s:
            print("Yes")
            exit()
print("No")

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

Solution (Python):
print("YNeos"[len({*input()})<3::2])

Solution (Python):
print("YNeos"[len({*input()})<3::2])

Solution (Python):
s = input()
t = set(['a', 'b', 'c'])
u = set()
for i in s:
  u.add(i)
print('Yes' if t == u else 'No')

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

Solution (Python):
S=input()

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

Solution (Python):
S = input()

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

S = list(s())
S.sort()
if S == ['a','b','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 = str(input())
apple = []
for i in s:
    apple.append(i)
print("Yes" if len(apple) == len(set(apple)) else "No")

Solution (Python):


s = sorted(list(str(input())))

if ''.join(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()
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 set(s) == set(['a','b','c']):
  print('Yes')
else:
  print('No')

Solution (Python):

S = set(list(input()))


if S == {"a", "b", "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 = sorted(input())
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
	print('Yes')
else:
	print('No')

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

    if all(s in S for s in "abc"):
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
s = sorted(list(input()))
if s == ['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):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
kind = len(set(S))
bl = kind == 3
print('Yes' if bl else 'No')

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

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

S = input()

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

Solution (Python):
s = set(input())
if s == set(['a', 'b', '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=len(set(input()));print('NYoe s'[s==3::2])

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(list(input()))
print('Yes' if ''.join(s) == '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 len(set(S)) == 3 :
    print('Yes')
else:
    print('No')

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

Solution (Python):
S=input()
if len(set(S))==3:
  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):
def main():
    S = input()
    if sorted(list(S)) == sorted(list('abc')):
        return True
    return False
if main():
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
def actual(s):
    if (s[0] != s[1]) and (s[1] != s[2]) and (s[2] != s[0]):
        return 'Yes'

    return 'No'

s = input()
print(actual(s))

Solution (Python):
def actual(s):
    if set(s) == {'a', 'b', 'c'}:
        return 'Yes'

    return 'No'

s = input()
print(actual(s))

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

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

c_a = s.count('a')
c_b = s.count('b')
c_c = s.count('c')

if c_a == c_b == c_c ==1:
  print('Yes')
else:
  print('No')

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

Solution (Python):
print('Yes' if ''.join(sorted([i for i in input()]))=='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 = sorted(input())

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

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

if __name__ == '__main__':
  main()

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

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

Solution (Python):
import numpy as np

S=input()

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

Solution (Python):
n=input()
if len(set(n))==3:
    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):
a=input()
print("No") if a[0]==a[1] or a[1]==a[2] or a[0]==a[2] else print("Yes")

Solution (Python):
s = input()
s = [i for i in s]
s.sort()
print('Yes' if ''.join(s) == 'abc' 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):
print("Yes" if sorted(input()) == list("abc") else "No")

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

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

Solution (Python):
S = input()

if 'a' in S:
    if 'b' in S:
        if 'c' in S:
            print('Yes')
            exit(0)
print('No')

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

Solution (Python):
S= input()
ls = list(S)
ls.sort()
if ls == ["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):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    print('Yes') if s.count('a')==1 and s.count('b')==1 and s.count('c')==1 else print('No')


if __name__ == "__main__":
    main()

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 'a' in s and 'b' in s and 'c' in s else 'No')

Solution (Python):
s = 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()
l=set([])
for i in s:
    l.add(i)
if l==set(['a','b','c']):
    print('Yes')
else:
    print('No')

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import re
s=input()
count=0
if re.search(r'a',s):
    count+=1
if re.search(r'b',s):
    count+=1
if re.search(r'c',s):
    count+=1
if count==3:
    print('Yes')
else:
    print('No')

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

Solution (Python):
li = list(input())
li.sort()
s = ''
for i in li:
  s += i
if s == 'abc':
  print('Yes')
else:
  print('No')

Solution (Python):
import collections
counter = collections.Counter()

for i in input():
    counter[i]+=1

if len([i for i in counter.values() if i>=1]) ==3:
    print('Yes')
else:
    print('No')

Solution (Python):
import collections
counter = collections.Counter()

for i in input():
  	counter[i] += 1

if len([i for i in counter.values() if i >= 1]) == 3:
	print("Yes")
else:
    print("No")

Solution (Python):

l=list(input())
l.sort()

if l==list('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()
print("Yes" if "".join(sorted(A))=="abc" else "No")

Solution (Python):
print('NYoe s'[set(input())=={'a','b','c'}::2])

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

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()
print("Yes" if len(set(S)) == 3 else "No" )

Solution (Python):
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


s = S()
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")==1
b = s.count("b")==1
c = s.count("c")==1

print("Yes" if all([a, b, c]) else "No")

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

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

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

Solution (Python):
x = input()
if "a" in x and "b" in x and "c" in x:
    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 = sorted(input())

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

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

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

import sys
input = sys.stdin.readline









S = list(input().rstrip())

print("Yes" if "".join(sorted(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):

print(['No', 'Yes'][''.join(sorted(list(input()))) == 'abc'])

Solution (Python):
from collections import Counter
a = Counter("abc")
if a==Counter(input()):
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
s = input()
t = []
for c in s:
  t.append(c)
if sorted(t) == ['a', 'b', 'c']:
  print('Yes')
else:
  print('No')

Solution (Python):

"""
Created on Wed May 13 17:27:13 2020

@author: shinba
"""

s = input()

if s.count("a")*s.count("b")*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 == "abc" or s == "acb" or s == "bac" or s == "bca" or s == "cab" or s == "cba":
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
import math
import bisect

def main():
    s = ''.join(sorted(list(input())))
    if s == 'abc':
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
ok = True
for c in "abc":
    ok &= c in s

print('Yes' if ok 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()
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):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    S=list(input())
    S.sort()
    S=''.join(S)
    YesNo(S=='abc')
    

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()
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 = list(input())
if len(set(S)) == 3:
    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=="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 len(set(S)) == 3:
        print("Yes")
else:
        print("No")

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

if __name__ == '__main__':

    ABC_93_A()

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

Solution (Python):
S = input()
print("Yes" if all(c in S for c in "abc") else "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=input()
if a=='abc' or a=='acb' or a=='bac' or a=='bca' or a=='cab' or a=='cba':
  print('Yes')
else:
  print('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):
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):
import sys
import math


s = input()
li = [''] * 3
for i in range(3):
    li[i] = s[i]
li.sort()
li2 = ['a', 'b', 'c']
if (li == li2):
    print('Yes')
else:
    print('No')

Solution (Python):
s=list(input())
s = set(s)
sc = len(s)

if sc!=3:
  print('No')
else:
  print('Yes')

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):

s = set(input())
a = set(["a","b","c"])

print("Yes" if s == a else "No")

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

print('Yes' if tuple([i for i in rs()]) in list(permutations('abc')) else 'No')

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):
print("YNeos"[len(set(input()))<3::2])

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

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

Solution (Python):
from collections import Counter
s = list(input())
ans = Counter(s)
if ans['a']==1 and ans['b']==1 and ans['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()

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

Solution (Python):

S = input()

print("Yes" if set(S)=={"a", "b", "c"} else "No")

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

Solution (Python):
s=set(list(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('YNeos'[set(input())!=set('abc')::2])

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

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

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

Solution (Python):
n = input()

lst = []
for i in range(3):
  lst.append(n[i])
  
lst.sort()

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

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

Solution (Python):
s = ''.join(sorted(input()))
if 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=list(input())
s.sort()
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):
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(list(s))) == 3:
    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):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    if set(input())=={'a','b','c'}:
        print('Yes')
    else:
        print('No')
resolve()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if s in ['abc','acb','bca','bac','cab','cba']:
        print('Yes')
    else:
        print('No')
resolve()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

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

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

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

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()
s = sorted(s)
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

s = list(input())
s.sort()
ans = ""
for i in range(len(s)):
    ans += s[i]
if ans == "abc":
    print("Yes")
else:
    print("No")

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

Solution (Python):
s = input()
x = s.count('a')
y = s.count('b')
z = s.count('c')

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

Solution (Python):
s=str(input())
a=len(s)
s=set(s)
if a==len(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()
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())
s.sort()
l=['a','b','c']
print('YNeos'[s!=l::2])

Solution (Python):
s = list(input())
ans = 'Yes'
for i in ['a', 'b', 'c']:
    if i in s:
        continue
    ans = 'No'
print(ans)

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = list(input())
c = Counter(S)
if c["a"] > 0 and c["b"] > 0 and c["c"] > 0:
    if c["a"] == c["b"] == c["c"]:
        print("Yes")
        exit()
print("No")

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

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

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  


S = input()
if len(set(S)) == 3:
    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())
s.sort()
print('Yes'if s[0] == 'a' and s[1] == 'b' and s[2] == 'c' else 'No')

Solution (Python):
s=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=list(input())
S=sorted(S)

base=["a","b","c"]

if S==base:
    print("Yes")
else:
    print("No")

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

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

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

if __name__ == "__main__":
  resolve()

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

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

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

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

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

Solution (Python):
s=input()
a=list(s)
a.sort()
ss=""
for aa in a:
  ss+=aa
if ss=="abc":
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()