#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int n;
	string sb, sa;
	cin >> sb >> n >> sa;
	bool ans = false;
	int a = 0;
	int b = 0;
	string ns;
	REP(i, 3) {
		if (sb[i] == 'o') b++;
		if (sa[i] == 'o') a++;
	}
	if (a != b) {
		ans = true;
	}
	string s1 = sb;
	string s2 = sb;
	switch (n) {
	case 0:
		if (sb != sa) ans = true;
		break;
	case 1:
		ans = true;
		swap(s1[0], s1[1]);
		swap(s2[1], s2[2]);
		if (s1 == sa || s2 == sa) ans = false;
		break;
	default:
		break;
	}
	cout << (ans ? "SUCCESS" : "FAILURE") << endl;
	return 0;
}