#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
char c[1006][1006];
int i,j,p,q,n,m,d,t,r,k;
bool fl;
/// r - redove na tablicata; k - koloni na tablicata
/// koordinatite trqq sa s 1 po - malki
string s[10001];
struct Answer
{
    int l,r;
    string s;
}a[100001];
/**bool fff(string s,string f)
{
    return (s.size()<f.size());
}*/
void rek(int uk,int duma,int l,int r)
{
    if(fl)return ;
    if(uk>s[duma].size()-1){duma++;uk=0;}
    if(duma>n){fl=1;return ;}
    if(c[l][r-1]=='*' || c[l][r-1]==s[duma][uk])
    {
        if(uk==0 && duma!=1)
        {
            a[duma].l=l;
            a[duma].r=r-1;
        }
        else a[duma].s=a[duma].s+'L';
        rek(uk+1,duma,l,r-1);if(fl)return ;
        if(uk==0 && duma!=1)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
    }
    if(c[l][r+1]=='*' || c[l][r+1]==s[duma][uk])
    {
        if(uk==0 && duma!=1)
        {
            a[duma].l=l;
            a[duma].r=r+1;
        }
        else a[duma].s=a[duma].s+'R';
        rek(uk+1,duma,l,r+1);if(fl)return ;
        if(uk==0 && duma!=1)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
    }
    if(c[l-1][r]=='*' || c[l-1][r]==s[duma][uk])
    {
        if(uk==0 && duma!=1)
        {
            a[duma].l=l-1;
            a[duma].r=r;
        }
        else a[duma].s=a[duma].s+'U';
        rek(uk+1,duma,l-1,r);if(fl)return ;
        if(uk==0 && duma!=1)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
    }
    if(c[l+1][r]=='*' || c[l+1][r]==s[duma][uk])
    {
        if(uk==0 && duma!=1)
        {
            a[duma].l=l+1;
            a[duma].r=r;
        }
        else a[duma].s=a[duma].s+'D';
        rek(uk+1,duma,l+1,r);if(fl)return ;
        if(uk==0 && duma!=1)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
    }
    if(r-1>0 && !c[l][r-1])
    {
        if(uk==0)
        {
            a[duma].l=l;
            a[duma].r=r-1;
        }
        else a[duma].s=a[duma].s+'L';
        c[l][r-1]=s[duma][uk];

        rek(uk+1,duma,l,r-1);if(fl)return ;
        if(uk==0)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
        c[l][r-1]='\0';

    }
    if(r+1<1001 && !c[l][r+1])
    {
        if(uk==0)
        {
            a[duma].l=l;
            a[duma].r=r+1;
        }
        else a[duma].s=a[duma].s+'R';
        c[l][r+1]=s[duma][uk];
        rek(uk+1,duma,l,r+1);if(fl)return ;
        if(uk==0)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
        c[l][r+1]='\0';

    }
    if(l-1>0 && !c[l-1][r])
    {
        //cout<<uk<<" "<<duma<<" "<<l<<" "<<r<<" "<<s[duma][uk]<<endl;
        if(uk==0 && duma!=1)
        {
            a[duma].l=l-1;
            a[duma].r=r;
        }
        else a[duma].s=a[duma].s+'U';
        c[l-1][r]=s[duma][uk];
        rek(uk+1,duma,l-1,r);if(fl)return ;
        if(uk==0 && duma!=1)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
        c[l-1][r]='\0';
    }
    ///&& duma!=1
    if(l+1<1001 && !c[l+1][r])
    {
        if(uk==0)
        {
            a[duma].l=l+1;
            a[duma].r=r;
        }
        else a[duma].s=a[duma].s+'D';
        c[l+1][r]=s[duma][uk];

        //cout<<c[l+1][r]<<endl;
        rek(uk+1,duma,l+1,r);if(fl)return ;
        if(uk==0)
        {
            a[duma].l=0;
            a[duma].r=0;
        }
        else a[duma].s.erase(a[duma].s.size()-1,1);
        c[l+1][r]='\0';
    }
    if(uk==0 && !fl)
    {
        p=l;
        while(p<1001 && c[p][r])
        {
            p++;
        }
        if(p<=1000 && p!=l)
            rek(uk,duma,p,r);
    }

}
int main()
{
    freopen("crossword.in", "r", stdin);
    freopen("crossword.out", "w", stdout);
    cin>>t;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>s[i];
    }
    //if(t!=1){cout<<0<<endl;return 0;}
    ///sort(s+1,s+n+1,fff);
    a[1].l=500;a[1].r=500;
    c[500][500]=s[1][0];
    c[500][501]='*';
    if(s[1].size()>1)a[1].s=a[1].s+'R';
    rek(2,1,500,501);
    cout<<1000<<" "<<1000<<endl;
    for(i=1;i<=1000;i++)
    {
        for(j=1;j<=1000;j++)
        {
            if(!c[i][j])cout<<"#";
            else cout<<c[i][j];
        }
        cout<<endl;
    }
    for(i=1;i<=n;i++)
    {
        cout<<a[i].r-1<<" "<<a[i].l-1<<" "<<a[i].s<<endl;
    }
    return 0;
}
///W*H<=10^6
/**
1
1
banana
*/