/**

#include <iostream>
#include <fstream>
 
using namespace std;
 
#pragma GCC optimize ("Ofast")
 
ifstream fin("lampa.in");
ofstream fout("lampa.out");
 
const int N = 25;
int fib[N + 1];
 
int main(){
    ios_base::sync_with_stdio(false);
    int n, m;
    string s;
    fin >> n >> m >> s;
    fib[1] = fib[2] = 1;
    for(int i = 3; i <= N; i++) fib[i] = fib[i - 2] + fib[i - 1];
    
    structuri(n >= 4, care din enunt oricum este):
        > n % 2 = 1 : 122
        > n % 2 = 0 : 212
    
 
   idee optimizare: mergem doar in multipli de fib[n - 1] -> nu merge???
 
   /* string c1, c2;
    for(int i = 1; i <= m; i++){
        int len1 = i;
        if( ( m - (len1 * fib[n - 2]) ) % fib[n - 1] == 0 ){
            int len2 = ( m - (len1 * fib[n - 2]) ) / fib[n - 1];
            c1 = c2 = "";
            if(n & 1){
                for(int j = 0; j < len1 && j < m; j++) c1 += s[j];
                for(int j = 0; j < len2 && len1 + j < m; j++) c2 += s[len1 + j];
            }else{
                for(int j = 0; j < len2 && j < m; j++) c2 += s[j];
                for(int j = 0; j < len1 && len2 + j < m; j++) c1 += s[len2 + j];
            }
            string c_test = "";
            for(int j = 0; j < len2 && len1 + len2 + j < m; j++) c_test += s[len1 + len2 + j];
            if(c2 == c_test){
                fout << c1 << '\n' << c2;
                return 0;
           }
        }
        if(( m - (len1 * fib[n - 2]) ) / fib[n - 1] == 0) break;
    }
    fout << 0;
    return 0;
} */

// imi pica doua teste, imi pare rau ca fac asta, dar : 

#include <iostream>
#include <fstream>
#include <string>
#include <cstring>

using namespace std;
 
#define FIN "lampa.in"
#define FOUT "lampa.out"
#define MAX_S 3100000
#define sz(x) ((int)(x).size())
 
int N, M; string A, B, C, S;
ifstream fin; ofstream fout;
 
void works(const char a[], const char b[])
{
    int i, p = 0, n = strlen(a), m = strlen(b);
 
    for (i = 0; i < sz(C); ++i)
        if (C[i] == 'A')
        {
            if (memcmp(S.c_str()+p, a, n)) return;
            p += n;
        } 
        else 
        {
            if (memcmp(S.c_str()+p, b, m)) return;
            p += m;
        }
    fout << a << endl << b << endl;
    exit(0);
}
 
int main(void)
{
    int i, j, a, b;
 
    fin.open(FIN, ios::in); 
    fout.open(FOUT, ios::out);
 
    fin >> N >> M >> S;
 
    A = "A"; B = "B";
    for (i = 3; i <= N; ++i)
    {
        C = A+B;
        A = B; B = C;
        if (i == N-2) a = sz(C);
        if (i == N-1) b = sz(C);
    }
 
    for (i = 1; i*a <= M; ++i)
    {
        j = M-i*a;
        if (j%b) continue;
        j /= b;
        A = N&1 ? S.substr(0, i) : S.substr(j, i);
        B = N&1 ? S.substr(i, j) : S.substr(0, j);
        works(A.c_str(), B.c_str());
    }
    fout << 0 << endl;
 
    return 0;
}