import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


string A, B;
long N;

bool solve() {
  if (A.count('o') != B.count('o')) {
    return false;
  }
  int posA, posB;
  switch (A.count('o')) {
    case 0: {
      return true;
    }
    case 1: {
      posA = cast(int)(A.findSplit("o")[0].length);
      posB = cast(int)(B.findSplit("o")[0].length);
      break;
    }
    case 2: {
      posA = cast(int)(A.findSplit("x")[0].length);
      posB = cast(int)(B.findSplit("x")[0].length);
      break;
    }
    case 3: {
      return true;
    }
    default: assert(false);
  }
  if (posA == 1 && posB == 1) {
    return (N == 0 || N >= 2);
  }
  return (N >= abs(posB - posA));
}

void main() {
  try {
    for (; ; ) {
      A = readToken();
      N = readLong();
      B = readToken();
      const ans = solve();
      writeln(ans ? "FAILURE" : "SUCCESS");
    }
  } catch (EOFException e) {
  }
}