Score : $100$ points

问题陈述

高桥正前往AtCoder Land。他面前有一个指示牌，他想确定它是否写着AtCoder Land。

你将得到两个由空格分隔的字符串$S$和$T$。确定是否$S=$ AtCoder 且 $T=$ Land。

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

Problem Statement

Takahashi is heading to AtCoder Land. There is a signboard in front of him, and he wants to determine whether it says AtCoder Land.

You are given two strings $S$ and $T$ separated by a space. Determine whether $S=$ AtCoder and $T=$ Land.

Constraints

• $S$ and $T$ are strings consisting of uppercase and lowercase English letters, with lengths between $1$ and $10$, inclusive.

Input

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

$S$ $T$

Output

If $S=$ AtCoder and $T=$ Land, print Yes; otherwise, print No.

Sample Input 1

AtCoder Land

Sample Output 1

Yes

$S=$ AtCoder and $T=$ Land.

Sample Input 2

CodeQUEEN Land

Sample Output 2

No

$S$ is not AtCoder.

Sample Input 3

aTcodeR lANd

Sample Output 3

No

Uppercase and lowercase letters are distinguished.