#include<bits/stdc++.h>
using namespace std;

long long n, m;

struct A
{
    long long x, y, k;
    double dist;
};

struct B
{
    long long q1, q2, q3, q4, q5;
};



A a[50'010];
A b[50'010];
B ans[1'000'010];

void fastIO()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void read()
{
    cin>>n>>m;
    for (long long i=0; i<n; i++)
    {
        cin>>a[i].x>>a[i].y>>a[i].k;
        a[i].dist=0.00;
    }
    for (long long i=0; i<m; i++)
    {
        cin>>b[i].x>>b[i].y>>b[i].k;
    }
}


bool cmp(A& o1, A& o2)
{
    return o1.dist<o2.dist;
}

void sorter()
{
    sort(a, a+n, cmp);
    //sort(b, b+n, cmp);
}

long long br=0;
long long voinici_koito_trqbvat=0;

void BinarySearch()
{
    //voinici_koito_trqbvat=b[0].k;
    long long l=0, r=1000000000;
    while (l<r)
    {
        long long mid=(l+r)/2;
        long long u=mid;

        for (long long i=0; i<m; i++)
        {
            double drob=(double)sqrt(u*u-b[i].k*b[i].k);
            u=ceil(drob);
        }

        if (u<0) l=mid+1;
        else
        {
            r=mid-1;
            voinici_koito_trqbvat=mid;
        }
    }
}

void solve()
{
    long long x1, y1, u=0;

    BinarySearch();
    //cout<<voinici_koito_trqbvat<<endl;
    //cout<<voinici_koito_trqbvat<<endl;
    /*double mn=1'000'000'000'000'000'000;
    long long mnx, mny;
    long long index;
    for (long long i=0; i<n; i+=100)
    {
        long long re=a[i].k;
        long long x1=a[i].x;
        long long y1=a[i].y;
        double energy=0;
        for (long long j=0; re<voinici_koito_trqbvat; j++)
        {
            if (i==j) continue;
            energy+=(double)a[j].k*sqrt((a[j].x-x1)*(a[j].x-x1)+(a[j].y-y1)*(a[j].y-y1));
            re+=a[j].k;
        }
        if (mn>energy)
        {
            mnx=x1;
            mny=y1;
            mn=energy;
            index=i;
        }
    }*/

    x1=b[0].x+1;
    y1=b[0].y;

    for (long long i=0; i<n; i++)
    {
        a[i].dist=(double)sqrt((a[i].x-x1)*(a[i].x-x1)+(a[i].y-y1)*(a[i].y-y1));
    }

    sorter();

    //cout<<index<<" -> "<<x1<<" "<<y1<<endl;
    for (long long i=0; u<voinici_koito_trqbvat; i++)
    {
        ans[br].q1=a[i].x;
        ans[br].q2=a[i].y;
        ans[br].q3=x1;
        ans[br].q4=y1;
        ans[br].q5=min(a[i].k, voinici_koito_trqbvat-u);
        br++;
        u+=min(a[i].k, voinici_koito_trqbvat-u);
    }



    //cout<<"E";
    //u=voinici_koito_trqbvat;
    for (long long i=0; i<m; i++)
    {
        ans[br].q1=x1;
        ans[br].q2=y1;
        ans[br].q3=b[i].x;
        ans[br].q4=b[i].y;
        ans[br].q5=u;
        br++;
        //if (u<0) while(1) {};
        double drob=(double)sqrt(u*u-b[i].k*b[i].k);
        u=ceil(drob);
        x1=b[i].x;
        y1=b[i].y;
    }
}

void write()
{
    //cout<<"voinici -> "<<voinici_koito_trqbvat<<endl;
    cout<<br<<endl;
    for (long long i=0; i<br; i++) cout<<ans[i].q1<<" "<<ans[i].q2<<" "<<ans[i].q3<<" "<<ans[i].q4<<" "<<ans[i].q5<<'\n';
}
int main ()
{
    freopen("war.in", "r", stdin);
    freopen("war.out", "w", stdout);

    fastIO();
    read();
    solve();
    write();
    return 0;
}