#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#ifndef __MACRO_H__
#define __MACRO_H__

#define all(collection) (collection).begin(), (collection).end()  // begin to end
#define each(e, collection) for(auto& e: collection)              // for each
#define rep(i, begin, end) for (ll i = begin; i < end; i++)       // repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--)      // repeat reverse
#define size(collection) ((ll) (collection).size())               // collection size

#endif

namespace NyaGadget
{	// 数え上げライブラリ(引数にModライブラリなどを渡すことを想定)
	template< typename T > struct Counting
	{
		vector< T > fv, fvinv, inv;

		Counting(ll maxsize)
		{	// Hがn+r-1なので、vsizeをmaxsize * 2とする
			ll vsize = maxsize * 2;
			fv.resize(vsize + 1);
			fvinv.resize(vsize + 1);
			inv.resize(vsize + 1);
			fv[0] = fvinv[vsize] = inv[0] = 1;

			T mi;
			rep(i, 1, vsize + 1)
			{
				mi = i;
				fv[i] = mi * fv[i - 1];
			}
			fvinv[vsize] /= fv[vsize];

			repr(i, vsize - 1, -1)
			{
				mi = i;
				fvinv[i] = (mi + 1) * fvinv[i + 1];
			}

			rep(i, 1, vsize + 1)
				inv[i] = fvinv[i] * fv[i - 1];
		}

		T Factorial(ll k) { return fv[k]; }
		T FactorialInv(ll k) { return fvinv[k]; }
		T Inv(ll k) { return inv[k]; }

		T P(ll n, ll r)
		{
			if (r < 0 || n < r)
				return 0;
			return Factorial(n) * FactorialInv(n - r);
		}

		T C(ll n, ll r)
		{
			if (r < 0 || n < r)
				return 0;
			return Factorial(n) * FactorialInv(r) * FactorialInv(n - r);
		}

		T H(ll n, ll r)
		{
			if (n < 0 || r < 0)
				return 0;
			return r == 0 ? 1 : C(n + r - 1, r);
		}
	};
}

namespace NyaGadget
{	// MOD ライブラリ
	template<long long mod> struct ModLL
	{
		long long x;

		// コンストラクタ
		ModLL()
		{
			x = 0;
		}
		ModLL(long long x_)
		{
			x = x_ % mod + mod;
			if (x >= mod)
				x -= mod;
		}

		// 符号
		ModLL operator + () const { return x; }
		ModLL operator - () const { return (-x < 0) ? mod - x : -x; }

		// 加減乗除演算子
		ModLL& operator += (ModLL r)
		{
			if ((x += r.x) >= mod)
				x -= mod;
			return *this;
		}
		ModLL& operator -= (ModLL r)
		{
			if ((x -= r.x) < 0)
				x += mod;
			return *this;
		}
		ModLL& operator *= (ModLL r)
		{
			x = (unsigned long long) x * r.x % mod;
			return *this;
		}
		ModLL& operator *= (ll r)
		{
			x = (unsigned long long) x * r % mod;
			return *this;
		}
		ModLL& operator /= (ModLL r)
		{
			x = x * Inv(r.x, mod) % mod;
			return *this;
		}

		ModLL operator + (ModLL r) const { return ModLL(*this) += r; }
		ModLL operator - (ModLL r) const { return ModLL(*this) -= r; }
		ModLL operator * (ModLL r) const { return ModLL(*this) *= r; }
		ModLL operator * (ll r) const { return ModLL(*this) *= r; }
		ModLL operator / (ModLL r) const { return ModLL(*this) /= r; }

		// 逆元 x^{-1} (主に除算演算子で使用)
		long long Inv(long long a, long long m)
		{
			long long b = m, u = 1, v = 0;

			while (b)
			{
				long long t = a / b;
				a -= t * b; swap(a, b);
				u -= t * v; swap(u, v);
			}

			u %= m;

			return (u < 0) ? u + m : u;
		}

		// 比較演算子
		bool operator == (ModLL& r) const { return x == r.x; }
		bool operator != (ModLL& r) const { return x != r.x; }
		bool operator <  (ModLL& r) const { return x < r.x; }
		bool operator <= (ModLL& r) const { return x <= r.x; }
		bool operator >  (ModLL& r) const { return x > r.x; }
		bool operator >= (ModLL& r) const { return x >= r.x; }

		// 入出力演算子
		friend ostream& operator << (ostream& s, ModLL<mod> a)
		{
			s << a.x;
			return s;
		}
		friend istream& operator >> (istream& s, ModLL<mod>& a)
		{
			s >> a.x;
			return s;
		}
	};

	//*******************************************
	// [sample code]
	//
	//using namespace NyaGadget;
	//using mll = ModLL<1000000007>;
	//
	//int main(void)
	//{
	//	mll x, y(1000000009);
	//  mll div_x(12345678900000);
	//  mll div_y(100000);
	//
	//	div_x /= div_y;
	//
	//	cout << "x = " << x << endl;
	//  cout << "y = " << y << endl;
	//  cout << "div_x = " << div_x << endl;
	//	return 0;
	//}
	//*******************************************
	// [output]
	//
	// x = 0
	// y = 2
	// div_x = 123456789
	//*******************************************
}

using namespace NyaGadget;
using mll = ModLL<1000000007>;

int main(void)
{
	char type, buff;
	ll l, r;

	ll t; cin >> t;
	vector<mll> ans;
	Counting<mll> count(1000000);
	rep(i, 0, t)
	{
		cin >> type >> buff >> l >> buff >> r >> buff;
		if (type == 'C')
			ans.push_back(count.C(l, r));
		else if (type == 'P')
			ans.push_back(count.P(l, r));
		else
			ans.push_back(count.H(l, r));
	}

	each(e, ans)
		cout << e << endl;

	return 0;
}