cf 12B

B - Correct Solution?

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 12B

Appoint description: 
System Crawler  (2015-01-09)

Description

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.

Sample Input

Input

33101033

Output

OK

Input

45

Output

WRONG_ANSWER

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<set>
#include<vector>
using namespace std;
char a[20],b[20];
int len;
int main()
{
      scanf("%s%s",a,b);
      len=strlen(a);
      sort(a,a+len);
      int i=0;
      while(a[i]==‘0‘&&i<len) i++;
      if(i<len) swap(a[0],a[i]);
      if(strcmp(a,b)==0)
            printf("OK\n");
      else
            printf("WRONG_ANSWER\n");
      return 0;
}