import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

S = input()
N = INT()
T = input()

dp = [set() for i in range(8)]
dp[0].add(S)
for i in range(7):
    for s in dp[i]:
        dp[i+1].add(s[1]+s[0]+s[2])
        dp[i+1].add(s[0]+s[2]+s[1])

if N < 8:
    if T not in dp[N]:
        print('SUCCESS')
    else:
        print('FAILURE')
else:
    if T not in dp[N%2+6]:
        print('SUCCESS')
    else:
        print('FAILURE')