#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

ll N;
string s,t;
int ans;

int count(string x) {
	int res = 0;
	rep(i, x.size()) {
		res += x[i] == 'o';
	}
	return res;
}

int main() {
	cin >> s;
	cin >> N;
	cin >> t;

	if (count(s) != count(t)) {
		ans = 1;
	} else if (N == 0) {
		ans = s != t;
	} else if (N == 1) {
		swap(s[0], s[1]);
		ans = s != t;
		swap(s[0], s[1]);
		swap(s[1], s[2]);
		ans &= (s != t);
	} else {
		ans = 0;
	}
	if(ans) {
		cout << "SUCCESS" << endl;
	} else {
		cout << "FAILURE" << endl;
	}
	return 0;
}