#include <cstdio>
#include <ctime>
#include <utility>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;

const int xMax=128;

struct MyStruct
{
    int n, m, bonus, maxPoints;
    char table[xMax][xMax];
};

int places, dogs;
char ch;
clock_t tstart; //(clock()-tstart)/(CLOCKS_PER_SEC*1.0)
MyStruct a[xMax];

void f1(int iii, int x, int y, int cnt, pair<int, int> used[][xMax], vector<pair<int, int> > comp[xMax])
{
    comp[cnt][0].first+=(a[iii].table[x][y]-'0');
    used[x][y].first=cnt;
    comp[cnt].push_back({x, y});
    if(x-1>=1)
    {
        if(a[iii].table[x-1][y]!='#')
        {
            if(used[x-1][y].first==0)
            {
                used[x][y].second++;
                used[x-1][y].second++;
                f1(iii, x-1, y, cnt, used, comp);
            }
        }
    }
    if(x+1<=a[iii].n)
    {
        if(a[iii].table[x+1][y]!='#')
        {
            if(used[x+1][y].first==0)
            {
                used[x][y].second++;
                used[x+1][y].second++;
                f1(iii, x+1, y, cnt, used, comp);
            }
        }
    }
    if(y-1>=1)
    {
        if(a[iii].table[x][y-1]!='#')
        {
            if(used[x][y-1].first==0)
            {
                used[x][y].second++;
                used[x][y-1].second++;
                f1(iii, x, y-1, cnt, used, comp);
            }
        }
    }
    if(y+1<=a[iii].m)
    {
        if(a[iii].table[x][y+1]!='#')
        {
            if(used[x][y+1].first==0)
            {
                used[x][y].second++;
                used[x][y+1].second++;
                f1(iii, x, y+1, cnt, used, comp);
            }
        }
    }
}

bool cmp1(pair<int, int> aa, pair<int, int> bb)
{
    return aa.second>bb.second;
}

void f11(int xx, int yy, int compNow, int limit, int curr, string s, string &smax, pair<int, int> used[][xMax], char chh)
{
    if(curr==limit)
    {
        if(smax=="")
        {
            smax=s;
        }
        else
        if(s.size()<smax.size())
        {
            smax=s;
        }
        return;
    }
    if(used[xx-1][yy].first==compNow)
    {
        if(s.size()>1)
        {
            if(!(s[s.size()-2]=='U' && s[s.size()-1]=='D'))
            {
                f11(xx-1, yy, compNow, limit, (chh=='D'?curr:curr+1), s+"U", smax, used, 'U');
            }
        }
        else
        {
            f11(xx-1, yy, compNow, limit, (chh=='D'?curr:curr+1), s+"U", smax, used, 'U');
        }
    }
    if(used[xx+1][yy].first==compNow)
    {
        if(s.size()>1)
        {
            if(!(s[s.size()-2]=='D' && s[s.size()-1]=='U'))
            {
                f11(xx+1, yy, compNow, limit, (chh=='U'?curr:curr+1), s+"D", smax, used, 'D');
            }
        }
        else
        {
            f11(xx+1, yy, compNow, limit, (chh=='U'?curr:curr+1), s+"D", smax, used, 'D');
        }
    }
    if(used[xx][yy-1].first==compNow)
    {
        if(s.size()>1)
        {
            if(!(s[s.size()-2]=='L' && s[s.size()-1]=='R'))
            {
                f11(xx, yy-1, compNow, limit, (chh=='R'?curr:curr+1), s+"L", smax, used, 'L');
            }
        }
        else
        {
            f11(xx, yy-1, compNow, limit, (chh=='R'?curr:curr+1), s+"L", smax, used, 'L');
        }
    }
    if(used[xx][yy+1].first==compNow)
    {
        if(s.size()>1)
        {
            if(!(s[s.size()-2]=='R' && s[s.size()-1]=='L'))
            {
                f11(xx, yy+1, compNow, limit, (chh=='L'?curr:curr+1), s+"R", smax, used, 'R');
            }
        }
        else
        {
            f11(xx, yy+1, compNow, limit, (chh=='L'?curr:curr+1), s+"R", smax, used, 'R');
        }
    }
    //RLR
        //LRL
        //UDU
        //DUD
}

void task1(int iii)
{
    pair<int, int> used[xMax][xMax];
    int cnt=1;
    vector<pair<int, int> > Queue;
    vector<pair<int, int> > comp[10001];
    for(int i=0; i<xMax; ++i)
    {
        for(int j=0; j<xMax; ++j)
        {
            used[i][j]={0, 0};
        }
    }
    for(int i=1; i<=a[iii].n; ++i)
    {
        for(int j=1; j<=a[iii].m; ++j)
        {
            if(a[iii].table[i][j]=='#')
            {
                continue;
            }
            if(used[i][j].first==0)
            {
                comp[cnt].push_back({0, 0});
                f1(iii, i, j, cnt, used, comp);
                cnt++;
                Queue.push_back({cnt-1, comp[cnt-1][0].first});
            }
        }
    }
    sort(Queue.begin(), Queue.end(), cmp1);
    int xx, yy, xxmin=1e9;
    string ss;
    for(auto i:Queue)
    {
        for(int j=1; j<comp[i.first].size(); ++j)
        {
            if(used[comp[i.first][j].first][comp[i.first][j].second].second<xxmin)
            {
                xxmin=used[comp[i.first][j].first][comp[i.first][j].second].second;
                xx=comp[i.first][j].first, yy=comp[i.first][j].second;
            }
        }
        ss="";
        if(dogs)
        {
            printf("1\n%d %d\n", xx, yy);
            f11(xx, yy, i.first, comp[i.first].size()-1, 1, "", ss, used, '.');
            if(ss=="")
            {
                ss="STAY";
            }
            for(int ii=0; ii<ss.size(); ++ii)
            {
                printf("%c", ss[ii]);
            }
            printf("\n");
            dogs--;
        }
        else
        {
            break;
        }
    }
    if(dogs)
    {
        while(dogs--)
        {
            printf("0\n");
        }
    }
}

int main ()
{
    freopen("catsdogs.in", "r", stdin);
    freopen("catsdogs.out", "w", stdout);
    scanf("%d %d", &places, &dogs);
    for(int i=1; i<=places; ++i)
    {
        scanf("%d %d %d", &a[i].n, &a[i].m, &a[i].bonus);
        a[i].maxPoints=0;
        for(int j=1; j<=a[i].n; ++j)
        {
            for(int k=1; k<=a[i].m; ++k)
            {
                scanf(" %c", &a[i].table[j][k]);
                if(a[i].table[j][k]=='.')
                {
                    a[i].table[j][k]='#';
                }
                else
                if(a[i].table[j][k]!='#')
                {
                    a[i].maxPoints+=(a[i].table[j][k]-'0');
                }
            }
        }
    }
    task1(1);
    return 0;
}