#include <bits/stdc++.h>
using namespace std;
const int N=50000+5;
typedef long long ll;
const ll inf=0x3f3f3f3f3f3f;
int n,q; 
int a[N],b[N]; 
int gcd(int x,int y){
	if (y==0)return x;
	return gcd(y,x%y);
}
int main(){
	freopen ("gcdlcm.in","r",stdin);
	freopen ("gcdlcm.out","w",stdout);
	scanf("%d%d",&n,&q);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]); 
	}
	for (int i=1;i<=n;i++){
		scanf("%d",&b[i]);
	}
	while(q--){
		int opt,l,r,k;scanf("%d%d%d",&opt,&l,&r);
		if (opt==1){
			scanf("%d",&k);
			for (int i=l;i<=r;i++)a[i]=k;
		} 
		else{
			ll ans=inf; 
			for (int i=l;i<=r;i++){
				ll p=gcd(a[i],b[i]);
				ans=min(ans,1ll*a[i]*b[i]/(p*p));
			}
			printf("%lld\n",ans);
		}
	} 
	return 0;
}