#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

long long pw(long long a, long long b){ 
  long long r = 1LL;

  while(b){
    if(b & 1LL)r *= a;
    if(r >= MOD)r %= MOD;
    a *= a;
    if(a >= MOD)a %= MOD;
    b >>= 1LL;
  }
  return r;
}

long long nn[222222];
long long rr[222222];

int main(){
  long long ret;

  ret = 1LL;

  for(int i = 1; i < 222222; ++i){
    ret = (ret * i % MOD) % MOD;
    nn[i] = ret;
  }
  nn[0] = 1;
  
  ret =1LL;
  
  for(int i = 1; i < 222222; ++i){
    ret = (ret * pw(i, MOD - 2)) % MOD;
    rr[i] = ret;
  }
  rr[0] = 1;


  int n;
  scanf("%d\n",&n);
  rep(i,0,n){
    char c;
    int a, b;
    scanf("%c(%d,%d)\n", &c,&a,&b);
    // Give in!
  }
  return 0;
}