#include <bits/stdc++.h>
using namespace std;

const int INF = 998244353;

struct STLazy {
	int n;
	vector<int> tr, lz;

	STLazy(int n) : n(n), tr(4*n + 8), lz(4*n + 8) {}

	void push(int v, int lo, int hi) {
		if (lz[v] != 0) {
			tr[v] += lz[v];
			if(lo+1 != hi) {
				lz[v*2] += lz[v];
				lz[v*2+1] += lz[v]; 
			}
			lz[v] = 0;
		}
	}

	void update(int v, int lo, int hi, int l, int r, int val) {
		push(v, lo, hi);
		if (lo >= hi || lo >= r || hi <= l) return;

		if (lo >= l && hi <= r) {
			lz[v] += val; // put lazy tag here
			push(v, lo, hi);
			return;
		}

		int mid = (lo + hi) / 2;
		update(v*2, lo, mid, l, r, val);
		update(v*2 + 1, mid, hi, l, r, val);

		tr[v] = max(tr[2*v], tr[2*v+1]);
	}

	int query(int v, int lo, int hi, int l, int r) {
		push(v, lo, hi);
		if (lo >= hi || lo >= r || hi <= l) return -INF;

		if (lo >= l && hi <= r) return tr[v];

		int mid = (lo + hi)/2;
		int p1 = query(v*2, lo, mid, l, r);
		int p2 = query(v*2 + 1, mid, hi, l, r);
		
		return max(p1, p2);
	}

	void update(int l, int r, int val) {
		update(1, 0, n, l, r, val);
	}

	int query(int l, int r) {
		return query(1, 0, n, l, r);
	}
};

vector<int> pr = {2, 3, 5, 7};

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin >> n >> m;
	vector<STLazy> st(4, STLazy(n));
	while (m--) {
		string s; cin >> s;
		if (s[1] == 'U') {
			int l, r, x; cin >> l >> r >> x;
			l--;

			for (int i = 0; i < 4; i++) {
				int pw = 0;
				while (x % pr[i] == 0) {
					pw++; x /= pr[i];
				}
				if (pw == 0) continue;
				st[i].update(l, r, pw);
			}
		} else {
			int l, r; cin >> l >> r; l--;
			int ans = 0;
			for (int i = 0; i < 4; i++) {
				ans = max(ans, st[i].query(l, r));
			}
			cout << "ANSWER " << ans << '\n';
		}
	}

	return 0;
}