#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s, t;
    const string ok = "SUCCESS", ng = "FAILURE";
    int N;
    cin >> s;
    cin >> N;
    cin >> t;
    N = min(N, 2);
    int ss = 0, tt = 0;
    for (int i = 0; i < 3; i++) {
        if (s[i] == 'o') ss++;
        if (t[i] == 'o') tt++;
    }
    if (ss != tt) {
        cout << ok << endl;
        return 0;
    } else {
        if (ss == 0 || ss == 3) {
            cout << ng << endl;
            return 0;
        } else {
            int spos, tpos;
            if (ss == 1) {
                for (int i = 0; i < 3; i++) if (s[i] == 'o') spos = i;
                for (int i = 0; i < 3; i++) if (t[i] == 'o') tpos = i;
            } else {
                for (int i = 0; i < 3; i++) if (s[i] == 'x') spos = i;
                for (int i = 0; i < 3; i++) if (t[i] == 'x') tpos = i;
            }
            if (abs(spos-tpos) > N) cout << ok << endl;
            else cout << ng << endl;
        }
    }
    return 0;
}