103580: [Atcoder]ABC358 A - Welcome to AtCoder Land

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.

问题描述

高桥正在前往AtCoder乐园。 他面前有一个指示牌，他想知道上面是否写着AtCoder乐园。

你将得到两个由空格隔开的字符串$S$和$T$。 判断$S=$ AtCoder且$T=$ Land是否成立。

限制条件

• $S$和$T$是由大写和小写英文字母组成的字符串，长度在$1$到$10$之间（包括$1$和$10$）。

输入

从标准输入以以下格式获取输入：

$S$ $T$

输出

如果$S=$ AtCoder且$T=$ Land，打印Yes；否则，打印No。

样例输入1

AtCoder Land

样例输出1

Yes

$S=$ AtCoder且$T=$ Land。

样例输入2

CodeQUEEN Land

样例输出2

No

$S$不是AtCoder。

样例输入3

aTcodeR lANd

样例输出3

No

区分大小写。