from itertools import *
from bisect import *
#from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    s=input()
    n=II()
    t=input()
    sn=s.count("o")
    tn=t.count("o")
    if sn!=tn:
        print("SUCCESS")
        exit()
    if sn in [0,3]:
        print("FAILURE")
        exit()
    if n==0 and t!=s:
        print("SUCCESS")
        exit()
    if n==1:
        if (s[0]==s[1] and t[1]==t[2]) or (s[1]==s[2] and t[0]==t[1]) or (s[0]==s[2] and t[0]==t[2]):
            print("SUCCESS")
            exit()
    print("FAILURE")

main()