#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x %= p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;
void ng(){
	cout<<"FAILURE\n";
	exit(0);
}
void ok(){
	cout<<"SUCCESS\n";
	exit(0);
}
void solve()
{
	string s,t;
	int n;
	cin>>s>>n>>t;
	int o=0,o2=0;
	rep(i,3)if(s[i]=='o')++o;
	rep(i,3)if(t[i]=='o')++o2;
	
	if(o!=o2){
		ok();
	}
	else if(n==0){
		if(s!=t)ok();
		else ng();
	}else if(n==1){
		if(s==t){
			if(s[0]==s[1]||s[1]==s[2])ng();
			else ok();
		}else{
			int pos,pos2;
			if(o==1){
				rep(i,3)if(s[i]=='o')pos=i;
				rep(i,3)if(t[i]=='o')pos2=i;
			}else{
				rep(i,3)if(s[i]=='x')pos=i;
				rep(i,3)if(t[i]=='x')pos2=i;
			}
			if(abs(pos-pos2)==2)ok();
			else ng();
		}
	}else{
		ng();
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}