#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<sstream>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))


typedef pair<int,int> P;
typedef vector<pair<int,string> > pii;
typedef map<string,int> mi;



int main(){
	int n,a=0,b=0;
	string s,s2,s3,s4;
	bool ok=false;
	cin >> s >> n >> s2;
	for(int i=0;i<3;i++){
		if(s[i]=='o')a++;
		if(s2[i]=='o')b++;
	}
	if(a!=b)
		ok=true;
	if(n==0&&s!=s2)
		ok=true;
	else if(n==1){
		s3=s;
		s4=s;
		swap(s3[0],s3[1]);
		swap(s4[1],s4[2]);
		if(s3!=s2&&s4!=s2)
			ok=true;
	}
	if(ok)
		cout << "SUCCESS" << endl;
	else
		cout << "FAILURE" << endl;
return 0;
}