#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 2e9;

int main() {
  string s, t;
  int n;
  cin >> s >> n >> t;
  int cnt0 = 0, cnt1 = 0;
  rep(i,3) {
    if (s[i] == 'o') cnt0++;
    if (t[i] == 'o') cnt1++;
  }
  if (cnt0 != cnt1) {
    cout << "SUCCESS" << endl;
    return 0;
  }
  int cnt = 0;
  vector<int> ok(3, 0);
  for (int i = 0; i < 3; i++) {
    if (s[i] == 'x') continue;
    int id = -1;
    for (int j = 0; j < 3; j++) {
      if (t[j] == 'x') continue;
      if (ok[j]) continue;
      if (id == -1) id = j;
      else if (abs(id - i) > abs(j - i)) {
        id = j;
      }
    }
    ok[id] = 1;
    cnt += abs(id - i);
  }
  if (n < cnt) {
    cout << "SUCCESS" << endl;
    return 0;
  }
  n -= cnt;
  if (n % 2 == 1) {
    cout << "SUCCESS" << endl;
  } else {
    cout << "FAILURE" << endl;
  }
  return 0;
}