#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string b, a;
    ll n;
    cin >> b >> n >> a;
    if (n == 0) {
        cout << ((b == a) ? "FAILURE" : "SUCCESS") << endl;
    }
    else if (n == 1) {
        bool f = false;
        if (
            ((b[0] == a[0]) && (b[1] == a[2]) && (b[2] == a[1])) ||
            ((b[2] == a[2]) && (b[0] == a[1]) && (b[1] == a[0]))
        ) {
            f = true;
        }
        cout << (f ? "FAILURE" : "SUCCESS") << endl;
    }
    else {
        map<char, ll> bc, ac;
        rep(i, 3) bc[b[i]]++;
        rep(i, 3) ac[a[i]]++;
        bool f = true;
        for(auto x : bc) {
            if (ac[x.first] != x.second) {
                f = false;
                break;
            }
        }
        cout << (f ? "FAILURE" : "SUCCESS") << endl;
    }
    return 0;
}