#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;
list<long long int> Prime(int M) {
	list<long long int>P;
	P.push_back(2);
	P.push_back(3);
	for (int i = 5; i <= M; i += 6) {
		bool flag = true;
		for (auto j : P) {
			if (i%j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i);
		flag = true;
		for (auto j : P) {
			if ((i + 2) % j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i + 2);
	}
	return P;
}

long long int N, K, Q, M;
long long int ans;

string f;
string e;
int flag[2][3];
int difs;
int dife;

int main() {
	ios::sync_with_stdio(false);
	cin >> f;
	cin >> N;
	cin >> e;
	if ((f[0] == 'o'&&f[1] == 'o'&&f[2] == 'o')||(f[0] == 'x'&&f[1] == 'x'&&f[2] == 'x')) {
		if (e[0] == f[0] && e[1] == f[1] && e[2] == f[2])cout << "FAILURE\n";
		else cout << "SUCCESS\n";
		return 0;
	}
	for (int i = 0; i < 3; i++) {
		if (f[i] == 'o')flag[0][i]++;
		if (e[i] == 'o')flag[1][i]++;
	}
	if (flag[0][0] + flag[0][1] + flag[0][2] != flag[1][0] + flag[1][1] + flag[1][2]) {
		cout << "SUCCESS\n";
		return 0;
	}
	if (flag[0][0] + flag[0][1] + flag[0][2] == 2) {
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < 3; j++)flag[i][j] ^= 1;
		}
	}
	for (int i = 0; i < 3; i++) {
		if (flag[0][i])difs = i;
		if (flag[1][i])dife = i;
	}
	if (N > 1) {
		cout << "FAILURE\n";
		return 0;
	}
	if (N == 1) {
		if (difs + dife == 2)cout << "SUCCESS\n";
		else cout<< "FAILURE\n";
		return 0;
	}
	if (difs == dife)cout << "FAILURE\n";
	else cout<< "SUCCESS\n";
	return 0;
}