#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int main() {

  string bef; int N; string aft; cin >> bef >> N >> aft;
  minimize(N, 2);
  vector<string> v, v2;
  v.push_back(bef);
  rep(i, N) {
    for(auto& e: v) {
      auto s = e, t = e;
      swap(s[0], s[1]);
      swap(t[1], t[2]);
      v2.push_back(s), v2.push_back(t);
    }
    v.swap(v2);
    v2.clear();
  }

  cout << ( find(all(v), aft) == v.end() ? "SUCCESS" : "FAILURE" ) << "\n";

  return 0;
}