#include<bits/stdc++.h>
using namespace std;
typedef long long ll; 
typedef pair<long long,long long> pll;
typedef double db;
map<pll,char> mp;
map<pll,ll> cnt;
struct node{
	ll x;
	ll y;
	ll r;
	char c;
	ll ti;
};
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n;
	cin>>n;
	vector<node> ss;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		ll x,y,r;
		char c;
		ll x0,x2,y0,y2;
		if(s[0]=='C'){
		//	cout<<"s1: "<<endl;
			cin>>x>>y>>r>>c;
			ss.push_back({x,y,r,c,i});
		}else if(s[0]=='R'&&s[2]=='c'){
		//	cout<<"s2: "<<endl;
			cin>>x0>>y0>>x2>>y2>>c;
			for(int j=y2;j>=y0;j--){
				for(int k=x0;k<=x2;k++){
					mp[{j,k}]=c;
					cnt[{j,k}]=i;
				}
			}
		}else{
		//	cout<<"s3: "<<endl;
			cin>>x0>>y0>>x2>>y2;
			for(int j=y2;j>=y0;j--){
				for(int k=x0;k<=x2;k++){
					char tt;
					ll t1=0,t2=0;
					for(auto u:ss){
						if((j-u.y)*(j-u.y)+(k-u.x)*(k-u.x)<=u.r*u.r){
							t1=u.ti;
							tt=u.c;
						}
					}
					if(t1>cnt[{j,k}]){
						mp[{j,k}]=tt;
						cnt[{j,k}]=t1;
						cout<<mp[{j,k}];
					}else{
						if(mp[{j,k}]>=33&&mp[{j,k}]<=126){
							cout<<mp[{j,k}];
						}else{
							mp[{j,k}]='.';
							cout<<'.';
						}
					}
				}
				cout<<'\n';
			}
		}
	}
	return 0;
}