#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

map<string,int> memo;

void solve(string s, int cnt, int N){
  if(cnt > N) return;
  if(memo.count(s) > 0) return;
  memo[s] = 1;
  
  swap(s[0], s[1]);
  solve(s, cnt+1, N);
  swap(s[0], s[1]);
  swap(s[1], s[2]);
  solve(s, cnt+1, N);
  swap(s[1], s[2]);
}

int main(){
  string SB, SA;
  int N;
  cin >> SB;
  cin >> N;
  cin >> SA;

  solve(SB, 0, N);


  
  if(memo.count(SA) > 0) cout << "FAILURE" << endl;
  else cout << "SUCCESS" << endl;
  
  return 0;
}