#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <random>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())
#define MP(a,b) make_pair(a,b)

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

int main(void){
	LL N;
	string Sbe,Saf;
	cin>>Sbe>>N>>Saf;
	if(N==0){
		if(Sbe!=Saf) cout<<"SUCCESS"<<endl;
		else cout<<"FAILURE"<<endl;
		return 0;
	}
	if(N==1){
		if((Sbe[0]==Saf[1] && Sbe[1]==Saf[0] && Sbe[2]==Saf[2]) ||
		(Sbe[2]==Saf[1] && Sbe[1]==Saf[2] && Sbe[0]==Saf[0])){
			cout<<"FAILURE"<<endl;
		}else cout<<"SUCCESS"<<endl;
		return 0;
	}
	int cnt=0;
	REP(i,3) if(Sbe[i]=='o') cnt++;
	REP(i,3) if(Saf[i]=='o') cnt--;
	if(cnt) cout<<"SUCCESS"<<endl;
	else cout<<"FAILURE"<<endl;
}