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

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

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

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

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

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

Solution (Python):
"""AtCoder"""

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

Solution (Python):
S = list(input())
if set(S) == {'a','b','c'}:
    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()
print("Yes" if len(s)==len(set(s)) else "No")

Solution (Python):
S = input()
if all(S.count(i) == 1 for i in 'abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

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

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

Solution (Python):


def main():
    S = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
print("Yes" if not str(input()).replace("a", "", 1).replace("b", "", 1).replace("c", "", 1) else "No")

Solution (Python):
S = input()
s = []
for i in range(3):
    s.append(str(S[i]))
s.sort()
input = str(s[0]) + str(s[1]) + str(s[2])
if input == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
def abc(s:str)->str:
    for i in "abc":
        if i not in s:
            return "No"
    return "Yes"
print(abc(input()))

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

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

Solution (Python):
s=input()
if len(set(s))==3:
  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):
def main():
  x = input()
  l = [x[0],x[1],x[2]]
  l.sort()
  if l == ['a', 'b', 'c']:
    print('Yes')
    return
  print('No')
  return

if __name__ == '__main__':
  main()

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

Solution (Python):
S = input()
print(["Yes","No"][S.count("a")>=2 or S.count("b")>=2 or S.count("c")>=2])

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 = str(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=list(input())
s=sorted(s)
if s==['a','b','c']:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s.find("a")<0 or s.find("b")<0 or s.find("c")<0:
    print("No")
else:
    print("Yes")

Solution (Python):
x=input()
print('No' if len(set(x))!=3 else ['No','Yes'][(x[0]in'abc')*(x[1]in'abc')*(x[2]in'abc')])

Solution (Python):
print("Yes" if len(set(input()))==3 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 = input()
if len(set(S)) == 3:
    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().strip()

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

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

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

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

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

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

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

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

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

Solution (Python):
a=list(input());print("YNeos"[len(set(a))!=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()))
if s==["a","b","c"]:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
can = ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']

print('Yes' if input() in can else 'No')

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):

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



def main():
    """Function."""
    s = str(input())
    if len(set([s[0], s[1], s[2]])) == 3:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
l = ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']

if(S in l): 
  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 = set(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):
S = input()

if (S.find("a") > -1 and S.find("b") > -1 and S.find("c") > -1) :
	print("Yes")
else :
	print("No")

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

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

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

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

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

Solution (Python):
import itertools

s=input()

x=list(itertools.permutations(('a','b','c'),3))
flag=0
for i in range(len(x)):
  if x[i][0]+x[i][1]+x[i][2] == s:
    flag=1

print('Yes' if flag==1 else 'No')

Solution (Python):

print('Yes' if input() in ['abc', 'acb', 'bac', 'bca', 'cab', 'cba'] 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()
S = sorted(S)
a = ""
for s in S:
    a += s
if a == "abc":
    print("Yes")
else:
    print("No")

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

ans = ""
for s in S:
	ans += s

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

Solution (Python):
n = input()
a = 0
b = 0
c = 0

for i in n:
	if i == "a":
		a += 1
	elif i == "b":
		b += 1
	elif i == "c":
		c += 1
if a == 1 and b == 1 and c == 1:
	print("Yes")
else :
	print("No")

Solution (Python):
a = input()
x = 0
y = 0
z = 0
for i in a:
        if i == "a":
                x += 1
        elif i == "b":
                y += 1
        else:
                z += 1
if x == 1 and y == 1 and z == 1:
        print("Yes")
else:
        print("No")

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

Solution (Python):
S = input()

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

Solution (Python):
s=input()
if s[0]==s[1] or s[1]==s[2] or s[0]==s[2]:
  print('No')
else:
  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 = list(input())

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

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

    i = 1
    for l in s:
        if l == "a":
            i *= 2
        elif l == "b":
            i *= 3
        elif l == "c":
            i *= 5

    if i == 30:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):
print('YNeos'[set('abc')!=set(input())::2])

Solution (Python):
print('YNeos'[set('abc')!=set(input())::2])

Solution (Python):
S=input()

S=list(S)

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

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



n = input()

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

Solution (Python):
import numpy as np
S = input()

a = False
b = False
c = False

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


def main():
    S = input()

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


main()

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

Solution (Python):
s = input()

a = s.find("a")
b = s.find("b")
c = s.find("c")
if (a >= 0 and b >= 0 and c >= 0) and a+b+c == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
s=list(input());print("YNeos"[len(set(s))<3::2])

Solution (Python):
s = input()

if len(set(s)) == 3:
    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()

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 S.count('a')*S.count('b')*S.count('c')==1 else 'No')

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

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

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

Solution (Python):
s = list(input())
s2 = list('abc')
a = set(s) & set(s2)
print('Yes') if len(a)==3 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):
if sorted(input())==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):
print('Yes' if ''.join(sorted(input())) == 'abc' else '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 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 S.count('a')*S.count('b')*S.count('c')==1 else 'No')

Solution (Python):
s=input()
ct=[0, 0, 0]
for c in s:
  ct[ord(c)-ord('a')]+=1
if(ct[0]==1 and ct[1]==1):
  print("Yes")
else:
  print("No")

Solution (Python):
NUM_STR = 3

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

Solution (Python):
import sys

words = list(raw_input().strip())
key = ['a', 'b', 'c']

if sorted(words) == key:
    print("Yes")
else:
    print("No")

Solution (Python):
i = input()

if(i[0] != i[1] and i[1] != i[2] and i[0] != i[2]):
    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 = raw_input()


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

Solution (Python):
from collections import Counter

print('Yes' if dict(Counter(input())) == {'a': 1, 'b': 1, 'c': 1} else 'No')

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

Solution (Python):
s = sorted(list(input()))
print('Yes' if ''.join(s) == '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):
print('YNeos'[len(set(input()))!=3::2])

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

if "".join(abc) == "abc":
    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):
print('YNeos'[len(set(input()))!=3::2])

Solution (Python):
s = input()

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

Solution (Python):
s = input()
abc=['a','b','c']


for i in range(len(s)):
  if s[i] in abc:
    abc.remove(s[i])

if len(abc) == 0:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
s = input()

if ''.join(sorted(list(s))) == 'abc':
    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())

s = sorted(s)

s = ''.join(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()

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

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

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

Solution (Python):

print(["No","Yes"][len(set(input()))==3])

Solution (Python):

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

Solution (Python):
l = sorted([i for i in input()])
print(["No", "Yes"]["".join(l) == "abc"])

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 = 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 = list(input())
s.sort()
abcL = ["a", "b", "c"]

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

Solution (Python):
S = input()
if all(x in S for x in ("a", "b", "c")):
    print("Yes")
else:
    print("No")

Solution (Python):
l = sorted([i for i in input()])
print("Yes" if "".join(l) == "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):
print("Yes" if len(set(list(input())))==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 s.count("a")==1 and s.count("b")==1 and s.count("c")==1:
    print("Yes")
else:
    print("No")

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

Solution (Python):
dic={}
for x in input():
    dic[x]=1
if sum(dic.values())==3:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
Input = sys.stdin.readline

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

Solution (Python):
s = input()

l = []
l.append(s[0])
l.append(s[1])
l.append(s[2])

l.sort()

t = ''.join(l)

if t == "abc":
    print("Yes")

else:
    print("No")

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

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

Solution (Python):

import math


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

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

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):
S = input()
ans = "No"

if len(S) == 3:
    if "a" in S:
        if "b" in S:
            if "c" in S:
                ans = "Yes"

print(ans)

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

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

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

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

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

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

Solution (Python):
if set(input()) ==set("abc"):
    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())
ls = list(s)
ls.sort()
ss = ''.join(ls)
print('Yes') if ss == 'abc' else print('No')

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

Solution (Python):
S = 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()
print("Yes" if "".join(sorted(S)) == "abc" else "No")

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

Solution (Python):

s=set(input())
x=set(list('abc'))


print('Yes' if s==x else 'No')

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

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 = S.replace("a", "", 1).replace("b", "", 1).replace("c", "", 1)
print("Yes" if len(S) == 0 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())
S.sort()
if S == ['a', 'b', 'c']:
    print("Yes")
else:
    print("No")

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

Solution (Python):
S =str(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 = str(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 range(len(S)):
  li.append(S[i])

if sorted(li) == ['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):
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") == S.count("b") == S.count("c") :
    print("Yes")
else :
    print("No")

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


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):
S = list(input())

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

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

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

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):
if set(input()) == set('abc'):
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)




def chkprint(*args):
    names = {id(v): k for k, v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg), '???')+' = '+repr(arg) for arg in args))




def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]




dp = None


def main():
    S = set(input().split()[0])

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


main()

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

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

y=sorted(x)

if y[0] == y[1] or y[1] == y[2]:
	print("No")
else:
	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 = 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[0]!=S[2] and S[1]!=S[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if(s.count("a")*s.count("b")*s.count("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()

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

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

Solution (Python):
import itertools
l=["".join(i) for i in itertools.permutations("abc")]
if input() in l:
  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 all([c in s for c in "abc"]) else "No")

Solution (Python):
S = input()

A = S.count("a")
B = S.count("b")
C = S.count("c")

if (A == 1) & (B == 1) & (C == 1):
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()

a = 0
b = 0
c = 0
for char in s:
    if char == 'a':
        a = 1
    if char == 'b':
        b = 1
    if char == 'c':
        c = 1
if a * b * c == 0:
    print('No')
else:
    print('Yes')

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

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

print("Yes") if sort == ["a","b","c"] 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()
sort = [s for s in S]
sort.sort()
if sort == ['a','b','c']:
    print('Yes')
else:
    print('No')

Solution (Python):
S = list(str(input()))
S.sort()
if(S[0]=='a' and S[1]=='b' and S[2]=='c'):
	print("Yes")
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()
s1=[s[0],s[1],s[2]]
s1.sort()
s1=s1[0]+s1[1]+s1[2]
if(s1!='abc'):
  print("No")
else:
  print("Yes")

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