#include<bits/stdc++.h>
using namespace std;


bool solve(string s,string t){
    set<string>S;
    for(int i=0;i<=2;i+=2){
        swap(s[1],s[i]);
        S.insert(s);
        swap(s[1],s[i]);
    }
    if(S.find(t)!=S.end())return true;
    return false;
}
int main(){
    string s,t;
    int n;
    cin>>s>>n>>t;
    if(count(s.begin(),s.end(),'o')!=count(t.begin(),t.end(),'o')){
        cout<<"SUCCESS"<<endl;
    }
    else if(n==0){
        if(s==t)cout<<"FAILURE"<<endl;
        else cout<<"SUCCESS"<<endl;
    }
    else if(n==1){
        cout<<(solve(s,t)?"FAILURE":"SUCCESS")<<endl;
        return 0;
    }
    else{
        cout<<"FAILURE"<<endl;
    }
    return 0;
}