#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 before, after;
    ll N;
    cin >> before;
    cin >> N;
    cin >> after;
    int bcnt = 0, acnt = 0;
    for (int i = 0; i < 3; i++) if (before[i] == 'o') bcnt++;
    for (int i = 0; i < 3; i++) if (after[i] == 'o') acnt++;
    bool success = false;
    if (bcnt != acnt) {
        success = true;
    } else {
        if (acnt == 1) {
            int bpos = 0, apos = 0;
            for (int i = 0; i < 3; i++) if (before[i] == 'o') bpos = i;
            for (int i = 0; i < 3; i++) if (after[i] == 'o') apos = i;
            if (abs(apos-bpos) > N || (abs(apos-bpos) % 2 != N%2)) success = true;
        } else if (acnt == 2) {
            int bpos = 0, apos = 0;
            for (int i = 0; i < 3; i++) if (before[i] == 'x') bpos = i;
            for (int i = 0; i < 3; i++) if (after[i] == 'x') apos = i;
            if (abs(apos-bpos) > N || (abs(apos-bpos) % 2 != N%2)) success = true;
        }
    }
    if (success) cout << "SUCCESS" << endl;
    else cout << "FAILURE" << endl;
    return 0;
}