## Algorithm

B. Correct Solution?
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 ≤ 109) without leading zeroes. The second lines contains one integer m (0 ≤ m ≤ 109) — Bob's answer, possibly with leading zeroes.

Output

Examples
input
Copy
3310
1033
output
Copy
OK
input
Copy
4
5
output
Copy

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main() {
string a, b;
cin >> a >> b;

sort(a.begin(), a.end());

if(a[0] == '0')
for(int i = 0; i < a.size(); i++)
if(a[i] != '0') {
a[0] = a[i];
a[i] = '0';
break;
}

if(a == b) cout << "OK" << endl;
else cout << "WRONG_ANSWER" << endl;

return 0;
}
Copy The Code &

Input

cmd
3310
1033

Output

cmd
OK