#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int N = 500000 + 10;
const int M = 4e4 + 10;
const int mod = 1000173169;
const double eps = 1e-10;
const double pi = acos(-1.0);
int n;
int cnt[2][10];
string s, t, mn;
bool work() {
  cin >> s >> t;
  if (s.size() != t.size()) return 0;
  int n = s.size();
  if (n == 1) return s == t;
  for (int i = 0; i < n; i++) {
    cnt[0][s[i] - '0']++;
    cnt[1][t[i] - '0']++;
  }
  int p = 1;
  while (cnt[0][p] == 0) p++;
  mn.push_back(p + '0');
  cnt[0][p]--;
  for (int i = 0; i < 10; i++) {
    while (cnt[0][i]--) mn.push_back(i + '0');
  }
  return mn == t;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  if (work())
    cout << "OK\n";
  else
    cout << "WRONG_ANSWER\n";
  return 0;
}
