#include #include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; // NOLINT using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false) template void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; } template void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; } template void input(Ts&... ts) { (cin >> ... >> ts); } template istream &operator,(istream &in, T &t) { return in >> t; } struct Inf { template constexpr operator T() { return numeric_limits::max() / 2; } }; // clang-format on int convert(string &s) { return (s[0] == 'o') * 4 + (s[1] == 'o') * 2 + (s[2] == 'o'); } int popcount(ll bits) { bits = (bits & 0x5555555555555555LL) + (bits >> 1 & 0x5555555555555555LL); bits = (bits & 0x3333333333333333LL) + (bits >> 2 & 0x3333333333333333LL); bits = (bits & 0x0f0f0f0f0f0f0f0fLL) + (bits >> 4 & 0x0f0f0f0f0f0f0f0fLL); bits = (bits & 0x00ff00ff00ff00ffLL) + (bits >> 8 & 0x00ff00ff00ff00ffLL); bits = (bits & 0x0000ffff0000ffffLL) + (bits >> 16 & 0x0000ffff0000ffffLL); return (bits & 0x00000000ffffffffLL) + (bits >> 32 & 0x00000000ffffffffLL); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); string s1; cin >> s1; int b1 = convert(s1); int n; cin >> n; string s2; cin >> s2; int b2 = convert(s2); if (popcount(b1) != popcount(b2)) { print("SUCCESS"); return 0; } if (s1 == "xxx" || s1 == "ooo") { print("FAILURE"); return 0; } chmin(n, 100 + (n % 100)); auto dp = make_v(n + 1, 8, false); dp[0][b1] = true; rep(i, 0, n) { rep(bit, 0, 8) { if (!dp[i][bit]) continue; int x = (bit & 4) >> 2, y = (bit & 2) >> 1, z = (bit & 1) >> 0; dp[i + 1][y << 2 | x << 1 | z] = true; dp[i + 1][x << 2 | z << 1 | y] = true; } } print(dp[n][b2] ? "FAILURE" : "SUCCESS"); return 0; }