#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 100000+10;
int n,q;
int num[maxn];
struct node{
    int lson,rson;
    int maxx;
    int num;
    bool flag;
    int mid(){
        return (lson+rson)>>1;
    }
}tree[maxn*4];
int gcd(int a,int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
void pushUp(int rt){
    tree[rt].maxx = max(tree[rt<<1].maxx,tree[rt<<1|1].maxx);
}
void pushDown(int rt){
    if(tree[rt].flag){
        tree[rt<<1].maxx = tree[rt<<1|1].maxx = tree[rt].maxx;
        tree[rt<<1].flag = tree[rt<<1|1].flag = true;
        tree[rt].flag = false;
    }
}
void build(int L,int R,int rt){
    tree[rt].lson = L;
    tree[rt].rson = R;
    tree[rt].flag = false;
    if(L==R){
        tree[rt].maxx = num[L];
        tree[rt].flag = true;
        return;
    }
    int mid = tree[rt].mid();
    build(L,mid,rt<<1);
    build(mid+1,R,rt<<1|1);
    pushUp(rt);
}
void update1(int L,int R,int l,int r,int rt,int x){
    if(L <= l && R >= r){
        tree[rt].flag = true;
        tree[rt].maxx = x;
        return;
    }
    pushDown(rt);
    int mid = tree[rt].mid();
    if(L <= mid){
        update1(L,R,l,mid,rt<<1,x);
    }
    if(R > mid){
        update1(L,R,mid+1,r,rt<<1|1,x);
    }
    pushUp(rt);
}
void update2(int L,int R,int l,int r,int rt,int x){
    if(tree[rt].maxx < x) return;
    if(L <= l && R >= r && tree[rt].flag && tree[rt].maxx > x){
        tree[rt].maxx = gcd(tree[rt].maxx,x);
        return;
    }
    pushDown(rt);
    int mid = tree[rt].mid();
    if(L<=mid) update2(L,R,l,mid,rt<<1,x);
    if(R>mid) update2(L,R,mid+1,r,rt<<1|1,x);
    pushUp(rt);
}
void print(int L,int R,int rt){
    if(L==R){
        printf("%d ",tree[rt].maxx);
        return;
    }
    pushDown(rt);
    int mid = tree[rt].mid();
    print(L,mid,rt<<1);
    print(mid+1,R,rt<<1|1);
}
int main(){

    int ncase;
    cin >> ncase;
    while(ncase--){
        scanf("%d",&n);
        for(int i = 1; i <= n; i++) scanf("%d",&num[i]);
        build(1,n,1);
        int a,b,c,d;
        scanf("%d",&q);
        while(q--){
            scanf("%d%d%d%d",&a,&b,&c,&d);
            if(a==1){
                update1(b,c,1,n,1,d);
            }else{
                update2(b,c,1,n,1,d);
            }
        }
        print(1,n,1);
        printf("\n");
    }
    return 0;
}