#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;


int main(){
    string a, b, f = "FAILURE", s = "SUCCESS";
    int n, an = 0, bn = 0;
    cin >> b >> n >> a;
    bool yes = false;
    for (int i = 0; i < 3; i++){
        if (b[i] == 'o') bn++;
        if (a[i] == 'o') an++;
    }
    if (bn == 1){
        if (b[0] == 'o' || b[2] == 'o'){
            if ((n%2) && (a[0] == 'o' || a[2] == 'o')) yes = true;
            else if (!(n%2) && a[1] == 'o') yes = true;
        } else {
            if ((n%2) && a[1] == 'o') yes = true;
            else if (!(n%2) && a[1] == 'x') yes = true;
        }
    } else if (bn == 2){
        if ((b[0] == 'x' || b[2] == 'x')) {
            if ((n%2) && a[1] == 'o') yes = true;
            else if (!(n%2) && a[1] == 'x') yes = true;
        } else {
            if ((n%2) && a[1] == 'x') yes = true;
            else if (!(n%2) && a[1] == 'o') yes = true;
        }
    }
    if (an != bn) cout << s << endl;
    else if (yes) cout << s << endl;
    else cout << f << endl;
}