#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

string r[2] = {"FAILURE", "SUCCESS"};

int main(){
	string s, t;
	int n;
	cin>>s>>n>>t;
	n = min(n, 1000);
	set<string> st;
	st.insert(s);
	for(int i = 0; i < n; i++){
		vector<string> d;
		for(string ss: st){
			swap(ss[0], ss[1]);
			d.push_back(ss);
			swap(ss[0], ss[1]);
			swap(ss[1], ss[2]);
			d.push_back(ss);
		}
		st.clear();
		for(string sss: d) st.insert(sss);
	}
	cout<<(st.count(t)==1?r[0]:r[1])<<endl;
	return 0;
}