#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

typedef array<ll, 5> squ;

ll Xmax, Ymax;

set<squ> sqs;

bool inter(squ A, squ B) {
    return max(A[0], B[0]) < min(A[0]+A[2], B[0]+B[2]) && max(A[1], B[1]) < min(A[1]+A[3], B[1]+B[3]);
}
bool cont(squ A, ll X, ll Y) {
    return A[0] <= X && A[0]+A[2] > X && A[1] <= Y && A[1]+A[3] > Y;
}

bool inBounds(squ A) {
    return A[0] >= 0 && A[1] >= 0 && A[0]+A[2] <= Xmax && A[1]+A[3] <= Ymax;
}

void swapXY() {
    set<squ> nxt;
    trav(a, sqs) {
        nxt.ins({a[1], a[0], a[3], a[2], a[4]});
    }
    swap(Xmax, Ymax);
    sqs = nxt;
}

void invX() {
    set<squ> nxt;
    trav(a, sqs) {
        nxt.ins({Xmax-a[0]-a[2], a[1], a[2], a[3], a[4]});
    }
    sqs = nxt;
}

void solve() {
    cin >> Xmax >> Ymax;

    string S;
    int cn = 0;
    while (cin >> S) {
        cn++;
        ll X, Y; cin >> X >> Y;
        if (S == "OPEN") {
            ll W, H; cin >> W >> H;
            squ nxt = {X, Y, W, H, cn};
            trav(a, sqs) {
                if (inter(a, nxt)) {
                    cout << "Command " << cn << ": OPEN - window does not fit" << nl; goto doneO;
                }
            }
            if (!inBounds(nxt)) {
                cout << "Command " << cn << ": OPEN - window does not fit" << nl; goto doneO;
            }
            sqs.ins(nxt);
            doneO:
            ;
        } else if (S == "CLOSE") {
            trav(a, sqs) {
                if (cont(a, X, Y)) {
                    sqs.erase(a);
                    goto doneC;
                }
            }
            cout << "Command " << cn << ": CLOSE - no window at given position" << nl;
            doneC:
            ;
        } else if (S == "RESIZE") {
            squ base = {-1,-1,-1,-1,-1};
            ll W, H; cin >> W >> H;
            trav(a, sqs) {
                if (cont(a, X, Y)) {
                    base = a;
                }
            }

            int cnt; squ nxt;
            if (base[0] == -1) {
                cout << "Command " << cn << ": RESIZE - no window at given position" << nl;
                goto doneR;
            }

            cnt = 0;
            nxt = base;
            nxt[2] = W; nxt[3] = H;
            trav(a, sqs) {
                if (inter(nxt, a)) cnt++;
            }
            if (!inBounds(nxt)) cnt+=2;
            if (cnt > 1) {
                cout << "Command " << cn << ": RESIZE - window does not fit" << nl;
                goto doneR;
            }

            sqs.erase(base);
            sqs.ins(nxt);
            doneR:
            ;
        } else {
            ll DX, DY; cin >> DX >> DY;
            bool flXY = false, flX = false;
            if (DY != 0) {
                swap(X, Y);
                swap(DX, DY);
                flXY = true;
                swapXY();
            }
            if (DX < 0) {
                X = Xmax - X - 1;
                DX *= -1;
                flX = true;
                invX();
            }

            vector<squ> ops;
            squ base = {-1,-1,-1,-1,-1};
            ll oop;
            trav(a, sqs) {
                if (cont(a, X, Y)) {
                    base = a;
                }
            }
            if (base[0] == -1) {
                cout << "Command " << cn << ": MOVE - no window at given position" << nl;
                goto doneM;
            }

            sqs.erase(base);
            ops.pb(base);
            trav(a, sqs) {
                if (a[0] > base[0] && max(a[1], base[1]) < min(a[1]+a[3], base[1]+base[3])) {
                    ops.pb(a);
                }
            }
            trav(a, ops) {
                sqs.erase(a);
            }
            sort(all(ops));

            ops[0][0] += DX;
            FOR(i, 1, sz(ops)) {
                ops[i][0] = max(ops[i][0], ops[i-1][0] + ops[i-1][2]);
            }
            oop = max(0ll, ops.back()[0]+ops.back()[2]-Xmax);
            if (oop) {
                cout << "Command " << cn << ": MOVE - moved " << DX-oop << " instead of " << DX << nl;
            }
            trav(a, ops) {
                a[0] -= oop;
            }

            trav(a, ops) {
                sqs.ins(a);
            }




            doneM:
            ;

            if (flX) {
                invX();
            }
            if (flXY) {
                swapXY();
            }
        }
    }

    vector<squ> res;
    trav(a, sqs) {
        res.pb({a[4],a[0],a[1],a[2],a[3]});
    }
    sort(all(res));
    cout << sz(res) << " window(s):" << nl;
    trav(a, res) {
        cout << a[1]<<" " << a[2] << " " << a[3] << " " << a[4] << nl;
    }
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}