#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
int main() {
  ios_base::sync_with_stdio(false);
  string n[2], ans = "";
  int mn = 10;
  cin >> n[0] >> n[1];
  map<int, int> mp;
  for (int(i) = 0; (i) < (n[0].size()); (i)++) {
    mp[n[0][i] - '0']++;
    if (n[0][i] == '0') continue;
    mn = ((mn) < (n[0][i] - '0') ? (mn) : (n[0][i] - '0'));
  }
  if (mp[mn]) {
    ans += char(mn + '0');
    mp[mn]--;
  }
  for (int(i) = 0; (i) < (10); (i)++) {
    while (mp[i]) {
      ans += char(i + '0');
      mp[i]--;
    }
  }
  if (ans == n[1])
    cout << "OK";
  else
    cout << "WRONG_ANSWER";
  return 0;
}
