#include <cstdio>

#include <cstring>

#include <cmath>

#include <vector>

#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;

const int N = 2e4+;

int f[N][],g[N][];

int ret[N*],v[N],d[N],T,n,m;

struct Que

{

    int l,r,c,sum,id;

} p[N*];

void cdq(int l,int r,int x,int y)

{

    int mid=(l+r)>>;

    vector<Que>lf,rt,cur;

    lf.clear(),rt.clear(),cur.clear();

    for(int i=x; i<=y; ++i)

    {

        if(p[i].l>mid)rt.push_back(p[i]);

        else if(p[i].r<mid)lf.push_back(p[i]);

        else cur.push_back(p[i]);

    }

    if(cur.size())

    {

        for(int i=; i<=; ++i)f[mid][i]=g[mid][i]=INF;

        f[mid][v[mid]]=d[mid];

        for(int i=mid-; i>=l; --i)

        {

            for(int j=; j<=; ++j)

            {

                if(j>=v[i])

                {

                    if(j-v[i]==)f[i][j]=min(f[i+][j],d[i]);

                    else f[i][j]=min(f[i+][j],max(f[i+][j-v[i]],d[i]));

                }

                else f[i][j]=f[i+][j];

            }

        }

        for(int i=mid+; i<=r; ++i)

        {

            for(int j=; j<=; ++j)

            {

                if(j>=v[i])

                {

                    if(j-v[i]==)g[i][j]=min(g[i-][j],d[i]);

                    else g[i][j]=min(g[i-][j],max(g[i-][j-v[i]],d[i]));

                }

                else g[i][j]=g[i-][j];

            }

        }

        for(int i=; i<cur.size(); ++i)

        {

            if(cur[i].r==mid)

            {

                if(f[cur[i].l][cur[i].sum]>cur[i].c)ret[cur[i].id]=;

                continue;

            }

            bool flag=false;

            for(int j=; j<=cur[i].sum; ++j)

            {

                int dis;

                if(!j)dis=g[cur[i].r][cur[i].sum-j];

                else if(j==cur[i].sum)dis=f[cur[i].l][j];

                else dis=max(f[cur[i].l][j],g[cur[i].r][cur[i].sum-j]);

                if(dis<=cur[i].c)

                {

                    flag=true;

                    break;

                }

            }

            if(!flag)ret[cur[i].id]=;

        }

    }

    int cnt=x-;

    if(lf.size())

    {

        for(int i=; i<lf.size(); ++i)

            p[++cnt]=lf[i];

        cdq(l,mid,x,cnt);

    }

    if(rt.size())

    {

        x=cnt+;

        for(int i=; i<rt.size(); ++i)

            p[++cnt]=rt[i];

        cdq(mid+,r,x,cnt);

    }

}

int main()

{

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d%d",&n,&m);

        for(int i=; i<=n; ++i)scanf("%d",&v[i]);

        for(int i=; i<=n; ++i)scanf("%d",&d[i]);

        for(int i=; i<=m; ++i)

        {

            scanf("%d%d%d%d",&p[i].l,&p[i].r,&p[i].c,&p[i].sum);

            p[i].id=i;

            ret[i]=;

        }

        cdq(,n,,m);

        for(int i=; i<=m; ++i)printf("%d",ret[i]);

        printf("\n");

    }

    return ;

}