#include using namespace std; #define repu(i, begin, end) for (__typeof(begin) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) #define repe(i, begin, end) for (__typeof(begin) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) #define mem(a, x) memset(a, x, sizeof(a)) #define all(a) a.begin(), a.end() #define count_bits(x) __builtin_popcount(x) #define count_bitsll(x) __builtin_popcountll(x) #define least_bits(x) __builtin_ffs(x) #define least_bitsll(x) __builtin_ffsll(x) #define most_bits(x) 32 - __builtin_clz(x) #define most_bitsll(x) 64 - __builtin_clz(x) vector split(const string &s, char c) { vector v; stringstream ss(s); string x; while (getline(ss, x, c)) v.push_back(x); return v; } #define error(args...) { vector _v = split(#args, ','); err(_v.begin(), args); } void err(vector::iterator it) {} template void err(vector::iterator it, T a, Args... args) { cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n'; err(++it, args...); } typedef long long ll; const int MOD = 1000000007; template inline T tmin(T a, T b) {return (a < b) ? a : b;} template inline T tmax(T a, T b) {return (a > b) ? a : b;} template inline void amax(T &a, T b) {if (b > a) a = b;} template inline void amin(T &a, T b) {if (b < a) a = b;} template inline T tabs(T a) {return (a > 0) ? a : -a;} template T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;} inline void YES() { cout << "SUCCESS" << endl; exit(0); } inline void NO() { cout << "FAILURE" << endl; exit(0); } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); int n; string before, after; cin >> before >> n >> after; if (before == after) { if (n & 1) { if (before[0] == before[1] || before[1] == before[2]) NO(); else if (n == 1) YES(); else NO(); } else NO(); } else { string b = before, a = after; sort(all(b)); sort(all(a)); if (a != b) YES(); else { int cnt = 2; { swap(before[0], before[1]); if (before == after) amin(cnt, 1); swap(before[0], before[1]); } { swap(before[1], before[2]); if (before == after) amin(cnt, 1); swap(before[1], before[2]); } if (n < cnt) YES(); else NO(); } } return 0; }