# include <bits/stdc++.h>
using namespace std;
struct word
{
 string w;
 int id;
};
word p[10005];
string s[10005];
const int N=1000,M=1000;
char matrix[N][M];
stack <char> ans[10005];
int x[10005],y[10005];
mt19937 Rand_Gen(159865487);
int T;
bool star=false;
bool dfs(int t, int x, int y, int v)
{
  //  cout<<t<<" "<<x<<" "<<y<<" "<<v<<endl;
    bool fl;
    if(matrix[x][y]=='#')fl=true;
    else
        fl=false;
        if(fl)
        matrix[x][y]=s[t][v];
if(s[t].size()==v+1)return true;
    int i,j,d;    char ch = s[t][v+1];

      //  d = Rand_Gen()%6;
      //  if(d==0){
        if(x>0&&(matrix[x-1][y]==ch||matrix[x-1][y]=='*'))if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&(matrix[x+1][y]==ch||matrix[x+1][y]=='*'))if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
    if(y>0&&(matrix[x][y-1]==ch||matrix[x][y-1]=='*'))if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
    if(y<M-1&&(matrix[x][y+1]==ch||matrix[x][y+1]=='*'))if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
      //  }
      /*   if(d==1){
                if(x<N-1&&matrix[x+1][y]==ch)if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        if(x>0&&matrix[x-1][y]==ch)if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
        if(y<M-1&&matrix[x][y+1]==ch)if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
    if(y>0&&matrix[x][y-1]==ch)if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
        }
        if(d==2)
        {

                    if(y>0&&matrix[x][y-1]==ch)if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
              if(y<M-1&&matrix[x][y+1]==ch)if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
        if(x>0&&matrix[x-1][y]==ch)if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&matrix[x+1][y]==ch)if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}


        }
        if(d==3){   if(y<M-1&&matrix[x][y+1]==ch)if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
         if(y>0&&matrix[x][y-1]==ch)if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}

        if(x>0&&matrix[x-1][y]==ch)if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&matrix[x+1][y]==ch)if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}

        }
        if(d==4){    if(y>0&&matrix[x][y-1]==ch)if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
        if(x>0&&matrix[x-1][y]==ch)if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(y<M-1&&matrix[x][y+1]==ch)if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
     if(x<N-1&&matrix[x+1][y]==ch)if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        }
        if(d==5){
        if(x>0&&matrix[x-1][y]==ch)if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}

    if(y>0&&matrix[x][y-1]==ch)if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
    if(y<M-1&&matrix[x][y+1]==ch)if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
     if(x<N-1&&matrix[x+1][y]==ch)if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        }
*/
        //////////////////////////


   /* for(i=1;i<=6;i++)
    {
        d= Rand_Gen()%4;
         if(d==0&&x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(d==1&&x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
    if(d==2&&y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
    if(d==3&&y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}

    }*/

           d = Rand_Gen()%6;
           if(T==2)d=0;
        if(d==0){
        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
    if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
    if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
        }
         if(d==1){
                if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
        if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
    if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
        }
        if(d==2)
        {

                    if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
              if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}


        }
        if(d==3){   if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
         if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}

        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}

        }
        if(d==4){    if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}
    if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
     if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        }
        if(d==5){
        if(x>0&&matrix[x-1][y]=='#')if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}

    if(y>0&&matrix[x][y-1]=='#')if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}
    if(y<M-1&&matrix[x][y+1]=='#')if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}
     if(x<N-1&&matrix[x+1][y]=='#')if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}
        }
       /* if(star==0&&v*3>4*s[t].size())
        {
            char prev;
            star = 1;
            if(x>0){prev = matrix[x-1][y];matrix[x-1][y]='*';if(dfs(t,x-1,y,v+1)){ans[t].push('L');return true;}}
            matrix[x-1][y] = prev;
             if(y>0){prev = matrix[x][y-1];matrix[x][y-1]='*';if(dfs(t,x,y-1,v+1)){ans[t].push('U');return true;}}
                  matrix[x][y-1] = prev;
              if(x<N-1){prev = matrix[x+1][y];matrix[x+1][y]='*';if(dfs(t,x+1,y,v+1)){ans[t].push('R');return true;}}
                   matrix[x+1][y] = prev;
               if(y<M-1){prev = matrix[x][y+1];matrix[x][y+1]='*';if(dfs(t,x,y+1,v+1)){ans[t].push('D');return true;}}
                    matrix[x][y+1] = prev;
               star = 0;
        }*/
        if(fl)matrix[x][y]='#';
    return false;
}
bool cmp(word i, word j)
{
    return i.w<j.w;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen("crossword.in","r",stdin);
freopen("crossword.out","w",stdout);
int i,j,n,t;
cin>>T;
cin>>n;
int l=0,k;
for(i=1;i<=n;i++)
{
    cin>>p[i].w;
    p[i].id=i;
}
sort(p+1,p+1+n,cmp);

for(i=0;i<N;i++)
    for(j=0;j<M;j++)
{
    matrix[i][j]='#';
}

for(t=1;t<=n;t++)
{
    bool fl=1;
    s[p[t].id]=p[t].w;
    for(i=0;fl&&i<N;i++)
        for(j=0;fl&&j<M;j++)
        {
            if(matrix[i][j]==s[p[t].id][0])
                if(dfs(p[t].id,i,j,0)){x[p[t].id]=i;y[p[t].id]=j;fl=0;}
        }
        for(i=0;fl&&i<N;i++)
        for(j=0;fl&&j<M;j++)
        {
            if(matrix[i][j]=='#')
               if(dfs(p[t].id,i,j,0)){x[p[t].id]=i;y[p[t].id]=j;fl=0;}
        }
}
cout<<N<<" "<<M<<endl;
for(i=0;i<M;i++){
    for(j=0;j<N;j++)
    cout<<matrix[j][i];
 cout<<endl;
}
for(t=1;t<=n;t++)
{
   cout<<x[t]<<" "<<y[t]<<" ";
    while(!ans[t].empty())
   {
      cout<<ans[t].top();
         ans[t].pop();
   }
    cout<<endl;
}
return 0;
}