#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct Graph {
    int moe;
    ll x1, y1;
    ll x2, y2;
    ll r;
    char c;
};

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int n;
    cin >> n;

    vector<Graph> a;
    for (int q = 1; q <= n; ++q) {
        string op;
        cin >> op;
        if (op[0] == 'C') {
            ll x, y, r;
            char c;
            cin >> x >> y >> r >> c;
            Graph now;
            now.moe = 0;
            now.x1 = x - r;
            now.y1 = y - r;
            now.x2 = x + r;
            now.y2 = y + r;
            now.r = r;
            now.c = c;
            a.push_back(now);
        } else if (op[0] == 'R' && ssize(op) > 6) {
            ll x1, y1, x2, y2;
            char c;
            cin >> x1 >> y1 >> x2 >> y2 >> c;
            Graph now;
            now.moe = 1;
            now.x1 = x1; now.x2 = x2;
            now.y1 = y1; now.y2 = y2;
            now.r = 0;
            now.c = c;
            a.push_back(now);
        } else {
            ll x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            
            vector ans(x2 - x1 + 10, vector(y2 - y1 + 10, '.'));
            for (int j = 0; j <= x2 - x1; ++j) {
                for (int k = 0; k <= y2 - y1; ++k) {
                    int fl = 0;
                    for (int l = ssize(a) - 1; l >= 0; --l) {
                        if (fl) break;
                        if (a[l].moe == 0) {
                            ll dx = a[l].x1 + a[l].r - (j + x1);
                            ll dy = a[l].y1 + a[l].r - (k + y1);
                            if (dx * dx + dy * dy <= a[l].r * a[l].r) {
                                ans[j][k] = a[l].c;
                                fl = 1;
                                break;
                            }
                        } else {
                            ll x = j + x1;
                            ll y = k + y1;
                            if (a[l].x1 <= x && x <= a[l].x2 && a[l].y1 <= y && y <= a[l].y2) {
                                ans[j][k] = a[l].c;
                                fl = 1;
                                break;
                            }
                        }
                    }
                }
            }
            for (int j = x2 - x1; j >= 0; --j) {
                for (int k = y2 - y1; k >= 0; --k) {
                    cout << ans[k][j];
                }
                cout << "\n";
            }
        }
    }
    return 0;
}
/*
6
Circle 0 0 5 *
Circle -2 2 1 @
Circle 2 2 1 @
Rectangle 0 -1 0 0 ^
Rectangle -2 -2 2 -2 _
Render -1 0 1 2
*/

/*
2
Rectangle 0 0 2 1 *
Render 0 0 2 2
*/