import Data.List (elemIndex)

data Result = SUCCESS | FAILURE
    deriving (Show)

count :: Eq a => a -> [a] -> Int
count n xs = length $ filter (\x -> x == n) xs

solve :: Integral a => String -> a -> String -> Result
solve sb n sa
    | ob /= oa      = SUCCESS
    | bd == Nothing = FAILURE
    | bd == Just 1 && ad == Just 1 = if n == 1
                 then SUCCESS
                 else FAILURE
    | d > n         = SUCCESS
    | otherwise     = FAILURE
    where
        ob     = count 'o' sb
        oa     = count 'o' sa
        xb     = count 'x' sb
        xa     = count 'x' sa
        c      = if ob < xb then 'o' else 'x'
        bd     = elemIndex c sb
        ad     = elemIndex c sa
        Just d = fmap (fromIntegral . abs) $ (-) <$> bd <*> ad

main = do
    sb <- getLine
    n  <- readLn
    sa <- getLine
    print $ solve sb n sa