#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
	string sb;
	cin >> sb;
	ll n;
	cin >> n;
	string sa;
	cin >> sa;

	set<string>sets;
	sets.insert(sb);
	if (n >= 1) {
		string sd[] = { "xoo","oxx","xxo","oox" };
		string sd2[] = { "oxo","xox","xox","oxo" };
		for (int i = 0;i < 4;i++) {
			if (sb == sd[i]) {
				sets.insert(sd2[i]);
				if (n >= 2) {
					for (int j = 0;j < 4;j++) {
						if (sd2[i] == sd2[j]) {
							sets.insert(sd[j]);
						}
					}
				}
			}
			if (sb == sd2[i]) {
				sets.insert(sd[i]);
			}
		}
	}
	cout << ((sets.find(sa) == sets.end()) ?  "SUCCESS":"FAILURE") << endl;
	return 0;
}