#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <cctype>

using namespace std;

typedef long long ll;

int main() {
	string s;
	cin >> s;
	int a;
	cin >> a;
	string z;
	cin >> z;
	int cnt1, cnt2;
	cnt1 = cnt2 = 0;
	for (int i = 0; i < s.size(); i++) {
		cnt1 += s[i] == 'o';
	}
	for (int i = 0; i < z.size(); i++) {
		cnt2 += z[i] == 'o';
	}
	if (cnt1 != cnt2) {
		cout << "SUCCESS" << endl;
		return 0;
	}
	string s1 = { s[1], s[0], s[2] }, s2 = { s[0], s[2], s[1] };
	string t1 = { s[1], s[2], s[0] }, t2 = { s[2], s[0], s[1] };
	string u = { s[2], s[1], s[0] };
	if ((a == 0 && s == z) ||
		(a%2 != 0 && (z == s1 || z == s2)) ||
		((a >= 3 && a%2 != 0) && z == u) ||
		(a > 0 && a%2 == 0 && (z == t1 || z == t2)) ||
		(a > 0 && a%2 == 0 && s == z)) {
		cout << "FAILURE" << endl;
	}else {
		cout << "SUCCESS" << endl;
	}

	return 0;
}