import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

Sbefore=readline().rstrip()
N=int(readline())
Safter=readline().rstrip()
inv_before=sum((Sbefore[i]=="x" and Sbefore[j]=="x") for i in range(3) for j in range(i+1,3))
inv_after=sum((Safter[i]=="x" and Safter[j]=="x") for i in range(3) for j in range(i+1,3))
idx_after=[i for i in range(3) if Sbefore[i]=="o"]
idx_before=[i for i in range(3) if Safter[i]=="o"]
if (inv_after-inv_before)%2==N%2 and len(idx_after)==len(idx_before) and sum(abs(a-b) for a,b in zip(idx_after,idx_before))<=N:
    ans="FAILURE"
else:
    ans="SUCCESS"
print(ans)