// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,a[maxn];

int B,t,L[1005],R[1005],bel[maxn],tag[1005],go[maxn],god[maxn];
void build(int id)
{
	For(i,L[id],R[id]){
		int v=max(1,a[i]-tag[id]);
		if(v<L[id])go[i]=v,god[i]=1;
		else go[i]=go[v],god[i]=god[v]+1;
	}
}

void mdf(int l,int r,int x)
{
	int bl=bel[l],br=bel[r];
	if(bl==br){
		For(i,l,r)a[i]=max(1,a[i]-x);
		build(bl);
		return;
	}
	For(i,l,R[bl])a[i]=max(1,a[i]-x);
	For(i,L[br],r)a[i]=max(1,a[i]-x);
	build(bl),build(br);
	For(i,bl+1,br-1){
		tag[i]=min(tag[i]+x,n);
		if(tag[i]<B)build(i);
	}
}

pii pre(int p){
	int b=bel[p];
	if(tag[b]<B)return mkp(go[p],god[p]);
	return mkp(max(a[p]-tag[b],1),1);
}
int getfa(int p){
	return max(1,a[p]-tag[bel[p]]);
}

vi buc[1005];
bool vis[maxn];
int st[maxn],top;
void add(int x){
	st[++top]=x;
	vis[x]=1;
	buc[bel[x]].pb(x);
}
bool vis2[maxn];
void query()
{
	top=0;
	int k=read();
	int res=0;
	For(i,1,k){
		int x=read();
		if(vis[x])continue;
		add(x);
	}
	int now=top;
	Rep(i,t,1){
		if(now==1)break;
		bool hav=0;
		int now2=now-buc[i].size();
		for(int x:buc[i]){
			pii tmp=pre(x);
			if(!vis[tmp.fi]) add(tmp.fi),++now2;
			else hav=1;
		}
		if(!hav){
			for(int x:buc[i]) res+=pre(x).se;
		}else{
			bool del=0,ok=0;
			Rep(j,R[i],L[i]) if(vis[j]) {
				++res;
				int up=getfa(j);
				vis[j]=0;
				--now;
				if(up<L[i]) ok=1;
				else if(!vis[up]) vis[up]=1,++now;
				if(now==1 && !ok){
					del=1;
					break;
				}
			}
			if(del)break;
		}
		now=now2;
		buc[i].clear();
	}
	For(i,1,top) vis[st[i]]=0; top=0;
	cout<<res+1<<"\n";
}

signed main()
{
	n=read(),m=read();
	For(i,2,n)a[i]=read();
	B=sqrt(n);
	t=(n-2)/B+1;
	For(i,1,t)L[i]=(i-1)*B+2,R[i]=min(n,i*B+1),build(i);
	For(i,1,t)For(j,L[i],R[i])bel[j]=i;
	For(_,1,m){
		int o=read();
		if(o==1){
			int l=read(),r=read(),d=read();
			mdf(l,r,d);
		}else{
			query();
		}
	}
	return 0;
}