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



Sample input:
bac


Sample output:
Yes

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
a,b,c = 0,0,0

for i in s:
    if i == "a":
        a += 1
    if i == "b":
        b += 1
    if i == "c":
        c += 1

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

Submission status: Accepted

Solution code:
ref = ['a', 'b', 'c']
s = list(input())
s.sort()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

S = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
l = len(set(n))
print("Yes" if l == 3 else "No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    if len(set([S[0], S[1], S[2]])) == 3:
        print(YES)
    else:
        print(NO)

# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = set(input())
t = {'a','b','c'}

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

Submission status: Accepted

Solution code:
s = input()

a = 0
b = 0
c = 0

for i in range(3):
    if s[i] == 'a':
        a = 1
    elif s[i] == 'b':
        b = 1
    elif s[i] == 'c':
        c = 1
        
if a*b*c==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = list(input())

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

else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
ans=input()
a=0
b=0
c=0
for i in ans:
    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")


"""
bac

Yes


bab

No

abc

Yes

aaa

No
"""

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = 'Yes'
for c in ['a', 'b', 'c']:
	if c not in s:
		ans = 'No'
		break
print(ans)

Submission status: Accepted

Solution code:
S = set(input())

T = {"a", "b", "c"}

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

Submission status: Accepted

Solution code:
s = input()
s_list = []
cnt = 0
for i in s:
    s_list.append(i)
s_list.sort()
if "".join(s_list) == "abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = set(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str( input() )
abclist = [ "abc", "acb", "bac", "bca", "cab", "cba" ]

if S in abclist:
   print( "Yes" )
else: 
   print( "No" )

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def Inn(s, t):
  return (t in s)

s = input()
if Inn(s, 'a') and Inn(s, 'b') and Inn(s, 'c'):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    S=STR()
    l=sorted(S)
    #print(l)
    if l[0]=='a' and l[1]=='b' and l[2]=='c':
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
a, b, c = 0, 0, 0
for i in S:
    if i == 'a': a += 1
    if i == 'b': b += 1
    if i == 'c': c += 1
print('Yes' if a == 1 and b == 1 and c == 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC093a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

s = list(input()[:-1])
s.sort()
print('YNeos'[s != list('abc')::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(map(str,input()))
print("No" if S[0]==S[1] or S[1]==S[2] or S[0]==S[2] else "Yes")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
ss= sorted(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations

S=input()
cand=["".join(t) for t in list(permutations(["a","b","c"],3))] # "a","b","c"を並び替えてできる文字列の候補

if S in cand: # ありえる場合
    print("Yes")
else: # ありえない場合
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

#入力
#S = str(input())
#a, b = map(int, input().split())
#N = int(input())
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

s = input()
C = collections.Counter(s)
# print(C)
for si in ("a","b","c"):
    if C[si]!=1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = list(input())
ac = 0
bc = 0
cc = 0
for i in s:
  if i == "a":
    ac += 1
  elif i == "b":
    bc += 1
  elif i == "c":
    cc += 1
if ac == 1 and bc == 1 and cc == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    S = SI()
    ans = "No"
    if "a" in S and "b" in S and "c" in S:
        ans = "Yes"
    print(ans)

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
S = input()

Rea=S.count('a')
Reb=S.count('b')
Rec=S.count('c')

if Rea == 1 and Reb == 1 and Rec == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

abc_list = ["abc", "acb", "bac", "bca", "cab", "cba"]

if S in abc_list:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

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

"""
ちょっとした解説

Sは3文字なので、a,b,cのすべての文字が含まれていれば"abc"を並び替えて作ることが出来ます。
逆に一つでもかけていた場合は"abc"の並び替えで作ることはできません。
よってin演算子でa,b,cが全てはいっているか調べてあげればよいです。

and演算子で3つの条件式をつなぐのを思いつくことも一つのポイント
実はカッコは不要で、if　("a" in S) and ("b" in S) and ("c" in S):
でもちゃんと動きます。
"""

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    S=set(input())
    print("Yes" if(len(S)==3) else "No")
resolve()

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls_s = [i for i in input()]

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

Submission status: Accepted

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

Submission status: Accepted

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

if S == ["a", "b", "c"]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

l = list(n)

l.sort()

k = l[0]+l[1]+l[2]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
l = []
for i in range(len(s)):
    l.append(s[i])
l_s = set(l)

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

Submission status: Accepted

Solution code:
print("YNeos"[sorted(input())!=list("abc")::2])

Submission status: Accepted

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

Submission status: Accepted

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

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

main()

Submission status: Accepted

Solution code:
S = input()
ans = []
for i in range(3):
  if S[i] not in ans:
    ans.append(S[i])
    
if len(ans) == 3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = set(input())
l = {'a', 'b', 'c'}

if S == l:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-07 02:35:07(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator

def main():
    s = sys.stdin.readline().rstrip()
    print('Yes' if len(set(s)) == 3 else 'No')


if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Accepted

Solution code:
A = list(input())
 
l = [0, 0, 0]
 
for i in range(len(A)):
  if A[i] == 'a':
    l[0] = 1
  elif A[i] == 'b':
    l[1] = 1
  else:
    l[2] = 1
    
if l[0] == 1 and l[1] == 1 and l[2] == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#abc of ABC
S = input()
if S[0] == S[1]:
    print("No")
elif S[0] == S[2]:
    print("No")
elif S[1] == S[2]:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# ABC 093: A – abc of ABC
s = input()
print('Yes' if s.count('a') == s.count('b') == s.count('c') else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()
ss = set()
ss.add(S[0])
ss.add(S[1])
ss.add(S[2])
if(len(ss) == 3):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
S=s[0]+s[1]+s[2]
if S=='abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
cA = 0
cB = 0
cC = 0
for i in s:
    if i == "a":
        cA+=1
    elif i == "b":
        cB +=1
    elif i == "c":
        cC +=1
    else:
        pass
if cA == 1 and cB==1 and cC == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
print('Yes' if all([True if S.count(s)==1 else False for s in 'abc']) else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
ans = 0
n = len(s)
for i in range(n):
    if s[i]=="a":
        ans +=1
    
    if s[i]=="b":
        ans +=2
    if s[i]=="c":
        ans +=3
if ans==6:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
a = 0
b = 0
c = 0
for i in S:
  if i == 'a':
    a += 1
  if i == 'b':
    b += 1
  if i == 'c':
  	c += 1
    
if a == 1 and b == 1 and c == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

import collections
count = collections.Counter(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
S = "".join(set(s))
print("Yes") if len(S) == 3 else print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input()
if len([x for x in set(l) if l.count(x) > 1]) > 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
s = input()
a = []
for i in range(3):
    a.append(s[i])
b = set(a)
if len(b) != 3:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
s = input()

s = set(s)

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

Submission status: Accepted

Solution code:
s=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print("Yes" if all(map(s.__contains__, ("a", "b", "c"))) else "No")

Submission status: Accepted

Solution code:
s = input()
a = b = c = 0

for i in range(3):
    if s[i] == "a":
        a += 1

    elif s[i] == "b":
        b += 1

    elif s[i] == "c":
        c += 1

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(str(input()))
s.sort()
s=''.join(map(str,s))
print('Yes' if s=='abc' else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
used=[0,0,0]
for x in S:
  if x=="a" and used[0] == 0:
    used[0]=1
  elif x=="b" and used[1]==0:
    used[1]=1
  elif x=="c" and used[2]==0:
    used[2]=1
  else:
    print("No")
    exit(0)
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    s = sorted(list(str(input().rstrip('\n'))))
    print("Yes" if "".join(s) == "abc" else "No")


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

Submission status: Accepted

Solution code:
s = [i for i in input()]
s.sort()
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()
s = sorted(list(s))

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

Submission status: Accepted

Solution code:
s=input();print('NYoe s'['a' in s and 'b' in s and 'c'in s::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

sort=sorted(s)

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in ["a","b","c"]:
  if i in S:
    cnt+=1
print("Yes" if cnt==3 else"No")

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

# N, M, = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
S = list(input().strip())

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

Submission status: Accepted

Solution code:
s = input()
s = sorted(list(s))

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

Submission status: Accepted

Solution code:
def aa093():
    sn = list(input())

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

aa093()

Submission status: Accepted

Solution code:
s = input()
l = [i for i in s]
r = ["a","b", "c"]
if sorted(l) == r:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
### 2019/09/25
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

type_list = []
for s in S:
    if s in type_list:
        pass
    else:
        type_list.append(s)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
if S.count("a")==0:
  print("No")
elif S.count("b")==0:
  print("No")
elif S.count("c")==0:
  print("No")           
else:
  print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

print("Yes" if "".join(sorted([i for i in input().rstrip()])) == "abc" else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = set(input())

if s == {'a', 'b', 'c'}:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC093 A - abc of ABC
s = input()
if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=list(input())
n.sort()
a=n[0]+n[1]+n[2]
if a=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#coding:utf-8

s = list(input())

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

Submission status: Accepted

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