#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	string str_bef,str_aft;
	int n,how_bef = 0,how_aft = 0;
	cin >> str_bef >> n >> str_aft;
	for(int i = 0;i < 3;i++){
		if(str_bef[i] == 'o') how_bef++;
		if(str_aft[i] == 'o') how_aft++;
	}

	if((n == 0 && str_bef != str_aft) || (how_bef != how_aft)){
		cout << "SUCCESS" << endl;
	}else if(n == 1 && str_bef[0] != str_bef[1] && str_bef[0] != str_bef[2] && str_aft[2] != str_aft[1] && str_aft[2] != str_aft[0]){
		cout << "SUCCESS" << endl;
	}else if(n == 1 && str_aft[0] != str_aft[1] && str_aft[0] != str_aft[2] && str_bef[2] != str_bef[1] && str_bef[2] != str_bef[0]){
		cout << "SUCCESS" << endl;
	}else if(n == 1 && str_bef[1] != str_bef[0] && str_bef[1] != str_bef[2] && str_bef == str_aft){
		cout << "SUCCESS" << endl;
	}else{
		cout << "FAILURE" << endl;
	}
	return 0;
}