#include <cstdio>

#define int long long

using namespace std;

const int N = 2e3 + 500;

int q;

int ty[N], x1[N], x2[N], y1[N], y2[N], r[N];
char sto[N];

inline bool inside(int tko, int x, int y){
	if(ty[tko] == 0) {
		return (x1[tko] - x) * (x1[tko] - x) + (y1[tko] - y) * (y1[tko] - y) <= r[tko] * r[tko];
	} else if(ty[tko] == 1) {
		return x1[tko] <= x && x <= x2[tko] && y1[tko] <= y && y <= y2[tko];
	} else {
		return false;
	}
}

char boja(int x, int y, int j){
	for(;j >= 0 && !inside(j, x, y);j--);
	return j < 0 ? '.' : sto[j];
}

char out[N];

signed main(){
	scanf("%lld", &q);
	for(int i = 0;i < q;i++) {
		char s[10]; scanf("%s", s);
		if(s[0] == 'R') ty[i] = 1 + (s[2] == 'n');
		if(ty[i] == 0) scanf("%lld%lld%lld %c", x1 + i, y1 + i, r + i, sto + i);
		if(ty[i] == 1) scanf("%lld%lld%lld%lld %c", x1 + i, y1 + i, x2 + i, y2 + i, sto + i);
		if(ty[i] == 2) {
			scanf("%lld%lld%lld%lld", x1 + i, y1 + i, x2 + i, y2 + i);
			for(int y = y2[i];y >= y1[i];y--) {
				for(int x = x1[i];x <= x2[i];x++) {
					out[x - x1[i]] = boja(x, y, i - 1);
				}
				out[x2[i] + 1 - x1[i]] = '\0';
				printf("%s\n", out);
			}
		}
	}
}