#include <iostream>

using namespace std;

int main() {
    int arr[8][8] = {0,};
    int n;
    
    string dol;
    string king;
    
    cin >> king >> dol >> n;
    
    king[0]-'A'king[1]-'0'-1 = 1;
    dol[0] -'A'dol[1]-'0'-1 = 2;
    
    for (int k = 0;k < n ;k++ ) { 
        string bangheong;
        cin >> bangheong;
        switch (bangheong) {
            case "R":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if ( {
                        if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                            if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                                dol[0]+1;
                                king[0]+1;
                            }
                            if (dol[0] = n-1) {
                                if (king[0] = dol[0]) {
                                    continue;
                                }
                                else {
                                    king[0]+1;
                                  }
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "L":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "B":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "T":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "RT":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "LT":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case"RB":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;


            
            case "LB":
                if (0 <= king[0]+1 < n && 0 <= king[1]) {
                    if (king[0]+1 == dol[0] && king[1] == dol[1]) {
                        if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                            dol[0]+1;
                            king[0]+1;
                        }
                        if (dol[0] = n-1) {
                            if (king[0] = dol[0]) {
                                continue;
                            }
                            else {
                                king[0]+1;
                            }
                        }
                    }
                }
                else{
                    if (0 <= dol[0]+1 < n && 0 <= dol[1] < n) {
                        dol[0]+1;
                    }
                    else{
                        continue;
                    }
                }
                break;
        }
    }



    
    cout << king[0] << king[1] << "\n";
    cout << dol[0] << dol[1] << "\n";
    
    return 0;
}