#include<cstdio>
#include<string>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define pb push_back


void saiki(set<string>& visit, string a, int d, int n){
	
	if(visit.find(a)!=visit.end())return;
	visit.insert(a);
	
	if(d>=n)return;
	
	rep(i,2){
		swap(a[i],a[i+1]);
		saiki(visit, a, d+1, n);
		swap(a[i],a[i+1]);
	}
}

int main(){
	string a,b;
	int n;
	cin>>a>>n>>b;
	
	set<string> A;
	saiki(A, a,0,min(20,n));
	
	if(A.find(b)==A.end()){
		puts("SUCCESS");
	}else{
		puts("FAILURE");
	}
}