Problem: Note that the memory limit is unusual.

There are n chefs numbered 1, 2, …, n that must prepare dishes for a king. Chef i has skill i and initially has a dish of tastiness a_i where |a_i| ≤ i. Each chef has a list of other chefs that he is allowed to copy from. To stop chefs from learning bad habits, the king makes sure that chef i can only copy from chefs of larger skill.

There are a sequence of days that pass during which the chefs can work on their dish. During each day, there are two stages during which a chef can change the tastiness of their dish. 

  1. At the beginning of each day, each chef can choose to work (or not work) on their own dish, thereby multiplying the tastiness of their dish of their skill (a_i := i ⋅ a_i) (or doing nothing).
  2. After all chefs (who wanted) worked on their own dishes, each start observing the other chefs. In particular, for each chef j on chef i's list, chef i can choose to copy (or not copy) j's dish, thereby adding the tastiness of the j's dish to i's dish (a_i := a_i + a_j) (or doing nothing). It can be assumed that all copying occurs simultaneously. Namely, if chef i chooses to copy from chef j he will copy the tastiness of chef j's dish at the end of stage 1.



All chefs work to maximize the tastiness of their own dish in order to please the king.

Finally, you are given q queries. Each query is one of two types.

  1. 1 k l r — find the sum of tastiness a_l, a_{l+1}, …, a_{r} after the k-th day. Because this value can be large, find it modulo 10^9 + 7. 
  2. 2 i x — the king adds x tastiness to the i-th chef's dish before the 1-st day begins (a_i := a_i + x). Note that, because the king wants to see tastier dishes, he only adds positive tastiness (x > 0). 



Note that queries of type 1 are independent of each all other queries. Specifically, each query of type 1 is a scenario and does not change the initial tastiness a_i of any dish for future queries. Note that queries of type 2 are cumulative and only change the initial tastiness a_i of a dish. See notes for an example of queries.

Input

The first line contains a single integer n (1 ≤ n ≤ 300) — the number of chefs.

The second line contains n integers a_1, a_2, …, a_n (-i ≤ a_i ≤ i).

The next n lines each begin with a integer c_i (0 ≤ c_i < n), denoting the number of chefs the i-th chef can copy from. This number is followed by c_i distinct integers d (i < d ≤ n), signifying that chef i is allowed to copy from chef d during stage 2 of each day.

The next line contains a single integer q (1 ≤ q ≤ 2 ⋅ 10^5) — the number of queries.

Each of the next q lines contains a query of one of two types: 

  * 1 k l r (1 ≤ l ≤ r ≤ n; 1 ≤ k ≤ 1000); 
  * 2 i x (1 ≤ i ≤ n; 1 ≤ x ≤ 1000). 



It is guaranteed that there is at least one query of the first type.

Output

For each query of the first type, print a single integer — the answer to the query.

Example

Input


5
1 0 -2 -2 4
4 2 3 4 5
1 3
1 4
1 5
0
7
1 1 1 5
2 4 3
1 1 1 5
2 3 2
1 2 2 4
2 5 1
1 981 4 5


Output


57
71
316
278497818

Note

Below is the set of chefs that each chef is allowed to copy from:

  * 1: \{2, 3, 4, 5\} 
  * 2: \{3\} 
  * 3: \{4\} 
  * 4: \{5\} 
  * 5: ∅ (no other chefs)



Following is a description of the sample.

For the first query of type 1, the initial tastiness values are [1, 0, -2, -2, 4].

The final result of the first day is shown below: 

  1. [1, 0, -2, -2, 20] (chef 5 works on his dish). 
  2. [21, 0, -2, 18, 20] (chef 1 and chef 4 copy from chef 5). 



So, the answer for the 1-st query is 21 + 0 - 2 + 18 + 20 = 57.

For the 5-th query (3-rd of type 1). The initial tastiness values are now [1, 0, 0, 1, 4].

Day 1

  1. [1, 0, 0, 4, 20] (chefs 4 and 5 work on their dishes). 
  2. [25,0, 4, 24, 20] (chef 1 copies from chefs 4 and 5, chef 3 copies from chef 4, chef 4 copies from chef 5). 



Day 2

  1. [25, 0, 12, 96, 100] (all chefs but chef 2 work on their dish). 
  2. [233, 12, 108, 196, 100] (chef 1 copies from chefs 3, 4 and 5, chef 2 from 3, chef 3 from 4, chef 4 from chef 5).

So, the answer for the 5-th query is 12+108+196=316. 




It can be shown that, in each step we described, all chefs moved optimally.

Solution (in CPP):

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

const int N=305;
const int K=1005;
const int mo=1000000007;
int n,Q;
int a[N],d[N],e[N][N];
int M[N][N],V[N][N],SV[N][N];
int tr[N][N],VP[K][N],IVP[K][N];
int power(int x,int y){
	int s=1;
	for (;y;y/=2,x=1ll*x*x%mo)
		if (y&1) s=1ll*s*x%mo;
	return s;
}
void init(){
	for (int i=1;i<N;i++){
		VP[0][i]=1; VP[1][i]=i;
		IVP[0][i]=1; IVP[1][i]=power(i,mo-2);
		for (int j=2;j<K;j++){
			VP[j][i]=1ll*VP[j-1][i]*VP[1][i]%mo;
			IVP[j][i]=1ll*IVP[j-1][i]*IVP[1][i]%mo;
		}
	}
}

int t[N][K];
void change(int x,int y,int v){
	for (y++;y<K;y+=y&(-y))
		t[x][y]=(t[x][y]+v)%mo;
		//t[x][y]+=v;
}
int ask(int x,int y){
	long long s=0;
	for (y++;y;y-=y&(-y)) s+=t[x][y];
	return s%mo;
}
void Construct(){
	memset(t,0,sizeof(t));
	for (int i=n;i>=1;i--){
		d[i]=(a[i]>0?0:1ll<<30);
		for (int j=i+1;j<=n;j++)
			if (e[i][j]) d[i]=min(d[i],d[j]+1); 
	}
	for (int i=1;i<=n;i++)
		if (d[i]!=(1<<30))
			for (int j=1;j<=i;j++)
				change(j,d[i],1ll*a[i]*tr[i][j]%mo*IVP[d[i]][j]%mo);
}
int main(){
	init();
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for (int i=1;i<=n;i++){
		int x,y;
		scanf("%d",&x);
		while (x--){
			scanf("%d",&y);
			e[i][y]=1;
		}
	}
	for (int i=1;i<=n;i++){
		M[i][i]=i;
		for (int j=1;j<=n;j++)
			if (e[j][i]) M[i][j]=i;
	}
	for (int i=1;i<=n;i++){
		V[i][i]=1;
		for (int j=i-1;j>=1;j--){
			for (int k=j+1;k<=i;k++)
				V[i][j]=(V[i][j]+1ll*V[i][k]*M[k][j])%mo;
			V[i][j]=1ll*(mo-V[i][j])*power(mo+j-i,mo-2)%mo;
		}
		for (int j=1;j<=n;j++)
			SV[i][j]=(SV[i][j-1]+V[i][j])%mo;
	};
	for (int i=1;i<=n;i++){
		tr[i][i]=1;
		for (int j=i-1;j>=1;j--)
			for (int k=j+1;k<=i;k++)
				tr[i][j]=(tr[i][j]+mo-1ll*tr[i][k]*V[k][j]%mo)%mo;
	}
	//cout<<233<<endl;
	Construct();
	scanf("%d",&Q);
	while (Q--){
		int tp,x,y,z;
		scanf("%d%d%d",&tp,&x,&y);
		if (tp==1){
			int ans=0;
			scanf("%d",&z);
			for (int i=y;i<=z;i++)
				if (d[i]>x)	ans=(ans+1ll*mo+a[i])%mo;
			for (int i=1;i<=n;i++)
				ans=(ans+1ll*ask(i,x)*VP[x][i]%mo*(SV[i][z]+mo-SV[i][y-1]))%mo;
			printf("%d\n",(ans%mo+mo)%mo);
		}
		if (tp==2){
			bool fl=(a[x]<=0);
			a[x]+=y;
			if (fl&&a[x]>0) Construct();
			else{
				if (d[x]!=(1<<30))
					for (int i=1;i<=n;i++)
						change(i,d[x],1ll*y*tr[x][i]%mo*IVP[d[x]][i]%mo);
			}
		}
	}
}