Your First Judge

AtCoder

IDabc215_a

Time2000ms

Memory256MB

Difficulty—

Given a string $S$, print `AC` if it perfectly matches `Hello,World!`; otherwise, print `WA`. What is a perfect match?Strings $A$ is said to perfectly match $B$ when the length of $A$ is equal to that of $B$, and the $i$\-th character of $A$ is the same as the $i$\-th character of $B$ for every integer $i$ such that $1 \le i \le |A|$. ## Constraints * $1 \le |S| \le 15$ * $S$ consists of English lowercase letters, English uppercase letters, `,`, and `!`. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

Hello,World!

Output #1

AC

The string $S$ perfectly matches `Hello,World!`.

Input #2

Hello,world!

Output #2

WA

The seventh character from the beginning should be an uppercase `W` in `Hello,World!`, but $S$ has a lowercase `w` in that position. Thus, $S$ does not match `Hello,World!`.

Input #3

Hello!World!

Output #3

WA

API Response (JSON)

{
  "problem": {
    "name": "Your First Judge",
    "description": {
      "content": "Given a string $S$, print `AC` if it perfectly matches `Hello,World!`; otherwise, print `WA`. What is a perfect match?Strings $A$ is said to perfectly match $B$ when the length of $A$ is equal to that",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc215_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given a string $S$, print `AC` if it perfectly matches `Hello,World!`; otherwise, print `WA`.\nWhat is a perfect match?Strings $A$ is said to perfectly match $B$ when the length of $A$ is equal to that...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments