#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<string,int> P;

int main() {
  string s,t;
  int n;
  cin >> s >> n >> t;
  if(!n && s!=t) {
    cout << "FAILURE" << endl;
  }
  set<string> v[2];
  queue<P> que;
  que.push(P(s,0));
  while(!que.empty()) {
    P p=que.front();que.pop();
    int k=p.S;
    if(!k && v[k].size()>1) continue;
    string r=p.F;
    int kk=(k+1)%2;
    swap(r[0],r[1]);
    if(!v[kk].count(r)) {
      que.push(P(r,kk));
      v[kk].insert(r);
    }
    r=p.F;
    swap(r[1],r[2]);
    if(!v[kk].count(r)) {
      que.push(P(r,kk));
      v[kk].insert(r);
    }
  }
  if(!v[n%2].count(t)) cout << "SUCCESS" << endl;
  else cout << "FAILURE" << endl;
  return 0;
}