#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

struct Point {
	double x, y;
};

string before, after;
LL n;

bool solve() {
	if (n == 0) {
		return (before != after);
	} else if (n == 1) {
		string t = before;
		swap(t[0], t[1]);
		if (before == after) return false;

		t = before;
		swap(t[1], t[2]);
		if (before == after) return false;

		return true;
	} else if (n <= 2) {
		return false;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> before >> n >> after;
	cout << (solve() ? "SUCCESS" : "FAILURE") << endl;
	return 0;
}