#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define LONG_INF 10000000000000000
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
int main() {
#define int long long
	string a, b;
	cin >> a;
	int n;
	cin >> n;
	cin >> b;
	int c = 0, d = 0;
	for (int i = 0;i < 3;++i) {
		if (a[i] == 'o')c++;
		if (b[i] == 'o')d++;
	}
	if (c != d) {
		cout << "SUCCESS" << endl;
		return 0;
	}
	if (c == 0) {
		cout << "FAILURE" << endl;
		return 0;
	}
	if (c == 3) {
		cout << "FAILURE" << endl;
		return 0;
	}
	if (c == 1) {
		if (a[1] == 'o'&&b[1] == 'o') {
			if (n != 1) {
				cout << "FAILURE" << endl;
			}
			else {
				cout << "SUCCESS" << endl;
			}
			return 0;
		}
		for (int i = 0;i < 3;++i) {
			if (a[i] == 'o') {
				for (int q = 0;q < 3;++q) {
					if (b[q] == 'o') {
						if (n < abs(i - q)) {
							cout << "SUCCESS" << endl;
						}else{
							cout << "FAILURE" << endl;
						}
						return 0;
					}
				}
			}
		}
	}
	else {
		if (a[1] == 'o') {
			if (a == b) {
				cout << "FAILURE" << endl;
				return 0;
			}
			if (b[1] == 'x') {
				if (n >= 1) {
					cout << "FAILURE" << endl;
				}
				else {
					cout << "SUCCESS" << endl;
				}
				return 0;
			}
			if (a[0] != b[0]) {
				if (n >= 2) {
					cout << "FAILURE" << endl;
				}
				else {
					cout << "SUCCESS" << endl;
				}
				return 0;
			}
			else {
				cout << "FAILURE" << endl;
			}
			return 0;
		}
		else {
			//a = "oxo"
			if (a == b) {
				if (n != 1) {
					cout << "FAILURE" << endl;
				}
				else {
					cout << "SUCCESS" << endl;
				}
				return 0;
			}
			if (n >= 1) {
				cout << "FAILURE" << endl;
			}
			else {
				cout << "SUCCESS" << endl;
			}
			return 0;
		}
	}
}