#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define YES "FAILURE"
#define NO "SUCCESS"

int main(int argc, char **argv) {
	string sb, sa;
	int b = 0, a = 0, N;
	cin >> sb;
	REP(i, 3) if (sb[i] == 'o') ++b;
	cin >> N >> sa;
	REP(i, 3) if (sa[i] == 'o') ++a;
	if (b != a || (N == 0 && sb != sa)) {
		cout << NO << endl;
		return 0;
	}
	if (b == 0 || (N == 0 && sb == sa) || N >= 2) {
		cout << YES << endl;
		return 0;
	}
	if (b == 2) {
		REP(i, 3) sb[i] = (sb[i] == 'o') ? 'x' : 'o';
		REP(i, 3) sa[i] = (sa[i] == 'o') ? 'x' : 'o';
	}
	cout << ((sb[1] == 'o') == (sa[1] == 'o') ? YES : NO) << endl;
	return 0;
}