#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template inline T sqr(T x) { return x*x; } typedef pair P; typedef long long ll; typedef unsigned long long ull; #define For(i,a,b) for(int (i) = (a);i < (b);(i)++) #define rep(i,n) For(i,0,n) #define clr(a) memset((a), 0 ,sizeof(a)) #define mclr(a) memset((a), -1 ,sizeof(a)) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(), (a).rend() #define sz(a) (sizeof(a)) #define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v) bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; } const int dx[9] = { -1, -1, -1, 0 , 0 , 0 , 1 , 1 , 1}, dy[9] = { -1, 0, 1 ,-1 , 0 , 1, -1 , 0, 1}; const int mod = 1000000007; const int INF = 1e9; int main() { string s1, s2; ull n; cin >> s1 >> n >> s2; if (!n){ if (s1 == s2){ cout << "FAILURE" << endl; return 0; } else{ cout << "SUCCESS" << endl; return 0; } } int sum1 = 0,sum2 = 0; rep(i, s1.size())if (s1[i] == 'o')sum1++; rep(i, s2.size())if (s2[i] == 'o')sum2++; if (sum1 != sum2){ cout << "SUCCESS" << endl; return 0; } if (n == 1){ if (sum1 == 2){ int x; rep(i, s1.size())if (s1[i] == 'x')x = i; if ((x == 0 && s2[2] == 'x') || (x == 2 && s2[0] == 'x')){ cout << "SUCCESS" << endl; return 0; } else{ cout << "FAILURE" << endl; return 0; } }else if (sum1 == 1){ int x; rep(i, s1.size())if (s1[i] == 'o')x = i; if ((x == 0 && s2[2] == 'o') || (x == 2 && s2[0] == 'o')){ cout << "SUCCESS" << endl; return 0; } else{ cout << "FAILURE" << endl; return 0; } } } cout << "FAILURE" << endl; return 0; }