#include<bits/stdc++.h> #define ll long long using namespace std; const int maxn=1e5+10; const ll inf=1e17+10; const ll mod=998244353; int n,m; int a[maxn],q[maxn]; bool check(int x,int num){ int cnt[50],ans=0; for(int i=1;i<=n;i++){ ans|=a[i]; for(int j=0;j<=30;j++){ if((1<<j)&a[i]) cnt[j]++; } if(i>x){ for(int j=0;j<=30;j++){ if((1<<j)&a[i-x]){ cnt[j]--; if(!cnt[j]) ans^=(1<<j); } } } // cout<<ans<<endl; if(ans>=num) return true; } return false; } int main(){ //freopen("beaco.in","r",stdin); //freopen("beaco.out","w",stdout); scanf("%d%d",&n,&m); bool fg=0; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } while(m--){ int opt; scanf("%d",&opt); if(opt==1){ int x,y; scanf("%d%d",&x,&y); a[x]=y; } else{ int x; scanf("%d",&x); int l=1,r=n,ans=-1; while(l<=r){ int mid=(l+r)>>1; if(check(mid,x)) r=mid-1,ans=mid; else l=mid+1; } printf("%d\n",ans); } } fclose(stdin); fclose(stdout); return 0; }