Score : $100$ points

问题陈述

你得到了一个由大写英文字母组成的长度为3的字符串$S$。

判断是否可以通过重新排列$S$中的字符，使其与字符串ABC匹配。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

You are given a string $S$ of length $3$ consisting of uppercase English letters.

Determine whether it is possible to rearrange the characters in $S$ to make it match the string ABC.

Constraints

• $S$ is a string of length $3$ consisting of uppercase English letters.

Input

The input is given from Standard Input in the following format:

$S$

Output

Print Yes if it is possible to rearrange the characters in $S$ to make it match the string ABC, and No otherwise.

Sample Input 1

BAC

Sample Output 1

Yes

You can make $S$ match ABC by swapping the first and second characters of $S$.

Sample Input 2

AAC

Sample Output 2

No

You cannot make $S$ match ABC no matter how you rearrange the characters.

Sample Input 3

ABC

Sample Output 3

Yes

Sample Input 4

ARC

Sample Output 4

No