/*
For the topic read several times, and then the keyword sort, the corresponding array sequence number is also sorted,
Eyde
Mblr
THAN
Mekt
Etoe
Eoth
MEETME
Bytheo
Ldoakt
Reenth
*/
#include <iostream>
#include <string>
#include <algorithm>
using namespace Std;
int main () {
int n;
string keyword;
while (cin>>keyword&&keyword!= "TheEND") {
string S;
cin>>s;
int len = Keyword.length ();
int slen = S.length ();
while (slen%len!=0) {
s = s + "X";
Slen = S.length ();
}
Slen = S.length ();
int row = Slen/len;
int column = Len;
int base = 0;
Char A[row][column];
Char B[row][column];
for (int i=0;i<column;i++) {
for (int j=0;j<row;j++) {
A[j][i]=s[base];
Base + +;
}
}
int Y[len];
Char S1[len];
for (int i=0;i<len;i++) {
S1[i] = Keyword[i];
}
for (int t=0;t<len;t++) {
Y[t] = t;
}
for (int i=0;i<len;i++) {
for (int j=0;j<len-i-1;j++) {
if (S1[j] > s1[j+1]) {
Swap (s1[j],s1[j+1]);
Swap (y[j],y[j+1]);
}
}
}
for (int w=0;w<column;w++) {
for (int r=0;r<row;r++) {
B[R][Y[W]] = a[r][w];
}
}
for (int w=0;w<row;w++) {
for (int r=0;r<column;r++) {
cout<<b[w][r];
}
}
cout<<endl;
}
return 0;
}
1036. Crypto Columns 2016 11 02