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

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

Examples

Input

3310
1033


Output

OK


Input

4
5


Output

WRONG_ANSWER
//shit..that was easy... :(
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<deque>
#include<stack>
#include<vector>
#include<set>
#include<unordered_set>
#include<list>
#include<bitset>
#include<map>
#include<iterator>
#include<algorithm>
#include<utility>
#include<functional>
#include<numeric>
#include<iomanip>
#include<unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define NL co<<nl
#define vd " "
#define F first
#define S second
#define fo(a,b) for(i=a;i<b;i++)
#define Fo(a,b) for(i=a;i>=b;i--)
#define fo1(a,b) for(j=a;j<b;j++)
#define Fo1(a,b) for(j=a;j>=b;j--)
#define fo2(a,b,c) for(i=a;i<=b;i+=c)
#define Fo2(a,b,c) for(i=a;i<=b;i-=c)
#define pb push_back
#define mp make_pair
#define popf pop_front
#define popb pop_back
#define eb emplace_back
#define ins insert
#define sf scanf
#define pf printf
#define all(v)  v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define tc(T) while(T--)
#define vec vector
#define co cout
#define beg begin()
#define rbeg rbegin()
#define ren rend()
#define en end()
#define d(x) co<<#x<<vd<<x<<nl
#define yes co<<"YES\n"
#define no co<<"NO\n"
#define yes2 co<<"Yes\n"
#define no2 co<<"No\n"
#define stol(s) stoll(s,nullptr,10)
#define vl vec<ll>
#define usl unordered_set<ll>
#define umll unordered_map<ll,ll>
#define mll map<ll,ll>
#define mcl map<char,ll>
#define mllit map<ll,ll>::iterator
#define mplll map<pair<ll,ll>,ll>
#define msl map<string,ll>
#define vs vector<string>
#define vld vector<long double>
#define vpsl vector<pair<string,ll>>
#define vpss vector<pair<string,string>>
#define vch vector<char>
#define vpchl vector<pair<char,ll>>
#define vsin(a,n) fo(0,n){cin>>s2;a.pb(s2);}
#define vchin(a,n) fo(0,n){cin>>ch;a.pb(ch);}
#define vpll vec<pair<ll,ll>>
#define sl set<ll>
#define mlb map<ll,bool>
#define vb vec<bool>
#define vs vector<string>
#define spll set<pair<ll,ll>>
#define spsl set<pair<string,ll>>
#define slit set<ll>::iterator
#define spllit set<pair<ll,ll>>::iterator
#define in(a,n) fo(0,n){cin>>a[i];}
#define vin(a,n) fo(0,n){cin>>q;a.eb(q);}
#define vsinin(a) {cin>>q;a.pb(q);}
#define vpin(a,n) fo(0,n){cin>>q>>w;a.pb({q,w});}
#define vpout(b,n) fo(0,n){co<<b[i].F<<vd<<b[i].S<<nl;}
#define out(a,n) fo(0,n){cout<<a[i]<<vd;}
#define in2d(a,n,m) fo(0,n){for(j=0;j<m;j++){cin>>a[i][j];}}
#define sin(s,n) fo(0,n){cin>>q;s.ins(q);}
#define vmapin(a,n,cnt) fo(0,n){cin>>q;a.pb(q);cnt[q]++;}
#define vsumin(a,n,sum) fo(0,n){cin>>q;sum+=q;a.pb(q);}
#define out2d(a,n,m) fo(0,n){for(j=0;j<m;j++){co<<a[i][j]<<vd;} co<<nl;}
#define outit(s,it) for(it=s.begin();it!=s.end();++it){co<<*it<<vd;}
#define factors(a,n) if(n==1){a.pb(1);} else{fo(1,sqrt(n)+1){if(n%i==0){a.pb(i);if(i!=n/i){a.pb(n/i);}}}sort(all(a));}
#define MX(a) *max_element(a,a+n)
#define MN(a) *min_element(a,a+n)
#define VMX(a) *max_element(all(a))
#define VMN(a) *min_element(all(a))
#define lowb(a,x) (std::lower_bound(a.begin(),a.end(),x)-a.begin())
#define upb(a,x) (std::upper_bound(a.begin(),a.end(),x)-a.begin())
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define max3(a,b,c) max(a,max(b,c))
#define max4(a,b,c,d) max(max3(a,b,c),d)
#define max5(a,b,c,d,e) max(max4(a,b,c,d),e)
#define min3(a,b,c) min(a,min(b,c))
#define min4(a,b,c,d) min(a,min3(b,c,d))
#define min5(a,b,c,d,e) min(a,min4(b,c,d,e))
#define brk break
#define con continue
#define END return
#define to_str to_string()
#define sor(x) sort(all(x))
#define sorl(x) sort(allr(x))
#define ft front()
#define bk back()
#define rev(x) reverse(all(x))
#define Fast {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
ll __=1,inf=9223372036854775807,mod=1000000007;
ld pi=2*acos(0.0);
inline ll ncr(ll n,ll r)
{
    ll l=n,f2=1,l2=n-r,i=1,j=1;
    if (r != 0||r!=n)
    {
        while (l2!=0||l!=r)
        {
            i*= l;
            j*= l2;
            ll m = gcd(i,j);
            i/= m;
            j/= m;
            l--;
            l2--;
        }
    }
    else
        i = 1;
    return i;
}
inline ll dig_sum(ll n)
{
    ll v=n,sum=0,i;
    while(v)
    {
        sum+=v%10;
        v/=10;
    }
    return sum;

}
inline bool ckprime(ll n)
{
    if(n%2==0&&n!=2)
        return false;
    else if(n==2)
        return true;
    else
    {
        ll v=sqrt(n),i;
        bool flag=true;
        for(i=3; i<=v; i+=2)
        {
            if(n%i==0)
            {
                flag=false;
                break;
            }
        }
        return flag;
    }

}
inline void solve()
{
    long long int n,sz=0,ans=0,blag=0,u,mn=0,ev=0,mx=0,mini,i,v,q,p,j,k,w,h,l,m,x,y,on=0,cc2=0,pp2=0,total=0,cc=0,pp=0,flag=0,klag=0,sum=0;
    string s,s1,s2;
    long double d1,d2,d3;
    bool ok=false,got=false;
    char ch,ch1;
    cin>>s>>s1;
    if(s.size()==1) {
        if(s!=s1)co<<"WRONG_ANSWER";
        else co<<"OK";
        END;
    }
    sor(s);
    n=s.size();
    fo(0,n) {
        if(s[i]!='0') {
            v=i;
            break;
        }
    }
    string s3;
    s3.pb(s[v]);
    s.erase(s.begin()+v);
    fo(0,n-1) {
        s3.pb(s[i]);
    }
    co<<s3<<nl;
    if(s3==s1)co<<"OK";
    else co<<"WRONG_ANSWER";
}
int main()
{
    Fast;
    //cin >> __;
    while(__--)
    {
        solve();

    }
    return 0;
}