#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;

bool dfs(string s, const string& t, int cur, int N) {
    if (cur == N) {
        if (s == t) return true;
        else return false;
    }
    swap(s[0], s[1]);
    if (dfs(s, t, cur+1, N)) return true;
    swap(s[0], s[1]);
    swap(s[1], s[2]);
    if (dfs(s, t, cur+1, N)) return true;
    return false;
}

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 (dfs(s, t, 0, N)) cout << ng << endl;
        else cout << ok << endl;
    }
    return 0;
}