#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define inf 0x3f3f3f3f
#define endl '\n'
#define pai acos(-1.0)

using namespace std;

int mp[25][25];
int vis[25][25];
int len[20] = {0,1,2,3,4,13,12,11,10,9,10,11,12,13,4,3,2,1};
int dy[20] = {0,0,0,0,4,-1,-1,-1,-1,0,0,0,0,-5,-1,-1,-1,-1};

void init()
{
    memset(mp,0,sizeof mp);
    memset(vis,0,sizeof vis);
    for(int i = 1; i <= 4; i++)
    {
    	for(int j = 1; j <= i; j++) 
        {
            mp[i][j] = 1; vis[i][j] = 1;
        }
    }
    for(int i = 5; i <= 8; i++)
    {
        for(int j = 1; j <= 9-i; j++) 
        {
            mp[i][j] = 6; vis[i][j] = 6; mp[i][len[i]-j+1] = 4; vis[i][len[i]-j+1] = 4;
        }
    }
    for(int i = 10; i <= 13; i++)
    {
        for(int j = 1; j <= i-10+1; j++)
        {
            mp[i][j] = 3; vis[i][j] = 3; mp[i][len[i]-j+1] = 5; vis[i][len[i]-j+1] = 5;
        }
    }
    for(int i = 14; i <= 17; i++)
    {
        for(int j = 1; j <= 17-i+1; j++)
        {
            mp[i][j] = 2; vis[i][j] = 2;
        }
    }
}

pii pos(string op,int x,int y)
{
    pii ans = {0,0};
    if(op.size() == 1)
    {
        if(op[0] == 'L')
            ans.second = -1;
        else if(op[0] == 'R')
            ans.second = 1;
    }
    else
    {
        if(op[0] == 'U')
        {
            ans.first = -1;
            ans.second -= dy[x-1];
            if(op[1] == 'L')
                ans.second --;
        }
        else if(op[0] == 'L')
        {
            ans.first = 1;
            ans.second = dy[x];
            if(op[1] == 'R')
                ans.second++;
        }
    }
    return ans;
}

bool check(vector<int>x)
{
    vector<int>y = x;
    reverse(y.begin(),y.end());
    return x == y;
}

bool obe(int x,int y,int nx,int ny)
{
    if((mp[x][y] == 1 || mp[x][y] == 2) && (vis[nx][ny] == 1 || vis[nx][ny] == 2 || vis[nx][ny] == 0))
        return 1;
    if((mp[x][y] == 3 || mp[x][y] == 4) && (vis[nx][ny] == 3 || vis[nx][ny] == 4 || vis[nx][ny] == 0))
        return 1;
    if((mp[x][y] == 5 || mp[x][y] == 6) && (vis[nx][ny] == 5 || vis[nx][ny] == 6 || vis[nx][ny] == 0))
        return 1;
    return 0;
}

struct node
{
    int x;
    int y;
};
bool cmp(node a,node b)
{
    if(a.x != b.x)
    return a.x < b.x;
    else
    return a.y < b.y;
}
void solve()
{
    int n;
    while(cin >> n)
    {
        init();
        // for(int i = 1; i <= 17; i++)
        // {
        //     for(int j = 1; j <= 17; j++)
        //     {
        //         cout << mp[i][j];
        //     }
        //     cout << endl;
        // }
        int playtimes = 1;
        for(int ao = 1; ao <= n; ao++)
        {
            int x,y;
            string dir;
            cin >> x >> y >> dir;
            if(playtimes++ != mp[x][y])
            {
                if(playtimes > 6) playtimes -= 6;
                continue;
            }
            if(playtimes > 6) playtimes -= 6;
            vector<pii>tmp;
            tmp.push_back({x,y});
            auto nn = pos(dir,x,y);
            // cout << nn.first << " " << nn.second << endl;
            while(1)
            {
                auto [x,y] = tmp.back();
                auto [dx,dy] = pos(dir,x,y);
                int nexx = x + dx; int nexy = y + dy;
                // cout << nexx << " " << nexy << endl;
                if(nexx <= 0 || nexx > 17 || nexy <= 0 || nexy > len[nexx])
                    break;
                tmp.push_back({nexx,nexy});
            }
            int tmplen = 0;
            // for(auto x:tmp)
            // {
            //     cout << x.first << " " << x.second << endl;
            // }
            // cout << endl;
            for(int i = 1; i < tmp.size(); i++)
            {
                auto [nx,ny] = tmp[i];
                if(mp[nx][ny] != 0)
                    continue;
                if(obe(x,y,nx,ny) == 0)
                    continue;
                // cout << nx << " " << ny << endl;
                if(i == 1)
                {
                    tmplen = 1;
                }
                else
                {
                    vector<int>cnt;
                    for(int j = 1; j < i; j++)
                    {
                        auto [df1,df2] = tmp[j];
                        if(mp[df1][df2] == 0)
                            cnt.push_back(0);
                        else
                            cnt.push_back(1);
                    }
                    int flag = 0;
                    for(auto jlc:cnt)
                        if(jlc != 0) flag = 1;
                    // for(auto jlc:cnt)
                    //     cout << jlc;
                    // cout << endl;
                    if(check(cnt) == 1 && flag == 1)
                        tmplen = i;
                }
            }
            // cout << tmplen << endl;
            if(tmplen != 0)
            {
                auto [df1,df2] = tmp[tmplen];
                // if(df1 == 13 && df2 == 10)
                //     cout << ao << endl;
                // cout << x << " " << y <<  " ### " << df1 << " " << df2 << endl;  
                // cout << mp[x][y] << " " << mp[df1][df2] << endl;
                swap(mp[x][y],mp[df1][df2]);
            }
        }
        vector<node>a[7];
        for(int i = 1; i <= 6; i++)
        {
            for(int j = 1; j <= 17; j++)
            {
                int tmp = 0;
                for(int k = 1; k <= 17; k++)
                {
                    if(mp[j][k] == i)
                    {
                        a[i].push_back({j,k});
                    }
                }
            }
        }
        for(int i = 1; i <= 6; i++)
        {
            sort(a[i].begin(),a[i].end(),cmp);
        }
        for(int i = 1; i <= 6; i++)
        {
            for(auto t:a[i])
            {
                cout << t.x << " " << t.y << " ";
            }
            cout << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t = 1;
    // cin>>t;
    while(t--)
    solve();
}


//cout << fixed << setprecision(5) << num << endl;
// priority_queue<int,vector<int>,less<int>>q;