Contest Duration: - (local time) (100 minutes) Back to Home
B - Caesar Cipher /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

• まず、非負整数 K を選ぶ。
• その後、S の各文字を K 個後ろの英小文字に変更する。

ただし、

• a1 個後ろの英小文字は b であり、
• b1 個後ろの英小文字は c であり、
• c1 個後ろの英小文字は d であり、
• \cdots
• y1 個後ろの英小文字は z であり、
• z1 個後ろの英小文字は a です。

### 制約

• ST はそれぞれ英小文字からなる長さ 1 以上 10^5 以下の文字列
• S の長さと T の長さは等しい

### 入力

S
T


### 入力例 1

abc
ijk


### 出力例 1

Yes


• a8 個後ろの i
• b8 個後ろの j
• c8 個後ろの k

それぞれ変更され、ST が一致します。

### 入力例 2

z
a


### 出力例 2

Yes


z1 個後ろの英小文字は a であることに注意してください。

### 入力例 3

ppq
qqp


### 出力例 3

No


### 入力例 4

atcoder
atcoder


### 出力例 4

Yes


Score : 200 points

### Problem Statement

Takahashi has a string S consisting of lowercase English letters.

On this string, he will do the operation below just once.

• First, choose a non-negative integer K.
• Then, shift each character of S to the right by K (see below).

Here,

• a shifted to the right by 1 is b;
• b shifted to the right by 1 is c;
• c shifted to the right by 1 is d;
• \cdots
• y shifted to the right by 1 is z;
• z shifted to the right by 1 is a.

For example, b shifted to the right by 4 is f, and y shifted to the right by 3 is b.

You are given a string T. Determine whether Takahashi can make S equal T by the operation above.

### Constraints

• Each of S and T is a string of length between 1 and 10^5 (inclusive) consisting of lowercase English letters.
• The lengths of S and T are equal.

### Input

Input is given from Standard Input in the following format:

S
T


### Output

If Takahashi can make S equal T, print Yes; if not, print No.

### Sample Input 1

abc
ijk


### Sample Output 1

Yes


When Takahashi chooses K=8,

• a is shifted to the right by 8 and becomes i,
• b is shifted to the right by 8 and becomes j,
• c is shifted to the right by 8 and becomes k,

and now S and T are equal.
Therefore, he can make S equal T, so Yes should be printed.

### Sample Input 2

z
a


### Sample Output 2

Yes


Choosing K=1 makes S and T equal.
Note that the letter on the right of z is a.

### Sample Input 3

ppq
qqp


### Sample Output 3

No


There is no non-negative integer K that he can choose to make S equal T, so No should be printed.

### Sample Input 4

atcoder
atcoder


### Sample Output 4

Yes


Choosing K=0 makes S and T equal.