Correct Solution?-CSDN博客

One cold winter evening Alice and her older brother Bob was sitting at home near the fireplace and giving each other interesting problems to solve. When it was Alice's turn, she told the number n to Bob and said:

—Shuffle the digits in this number in order to obtain the smallest possible number without leading zeroes.

—No problem! — said Bob and immediately gave her an answer.

Alice said a random number, so she doesn't know whether Bob's answer is correct. Help her to find this out, because impatient brother is waiting for the verdict.

Input

The first line contains one integer n (0 ≤ n ≤ 10⁹) without leading zeroes. The second lines contains one integer m (0 ≤ m ≤ 10⁹) — Bob's answer, possibly with leading zeroes.

Output

Print OK if Bob's answer is correct and WRONG_ANSWER otherwise.

Examples

Input

3310
1033

Output

OK

Input

4
5

Output

WRONG_ANSWER
两组数，要求第二组数为第一组中数字组成的最小的且第一位不为0的数；

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e7;
char a[maxn],b[maxn];
int main()
{
    int k=0;
    scanf("%s%s",a,b);
    char t;
    int len=strlen(a);
    sort(a,a+len);
    if((a[0]-'0')!=0)
    {
        if(strcmp(a,b)==0)
          cout<<"OK"<<endl;
        else
          cout<<"WRONG_ANSWER"<<endl;
    }
    if((a[0]-'0')==0)
    {
        for(int i=0;i<len;i++)
        {
            if((a[i]-'0')!=0)
            {
                k=i;
                break;
            }
        }
        t=a[0];a[0]=a[k];a[k]=t;
        if(strcmp(a,b)==0)
          cout<<"OK"<<endl;
        else
          cout<<"WRONG_ANSWER"<<endl;
    }
    return 0;          
}