#include <iostream>
#include <algorithm>
#include <math.h>

using namespace std;

int used[1000001];

struct tower {
    double x,y,count;
};

tower a[100000];
tower b[100000];
int m, n;
tower currPos;

bool cmp(tower i, tower j)
{
    return i.x < j.x;
}

bool cmp1(tower i, tower j)
{
    return i.x > j.x;
}

void read(){
    cin>>n>>m;
    for(int i = 1; i<=n;i++){
        cin>>a[i].x>>a[i].y>>a[i].count;
    }
    for(int i = 1; i<=m;i++){
        cin>>b[i].x>>b[i].y>>b[i].count;
    }
    sort(a+1,a+n+1,cmp);
    sort(b+1,b+m+1,cmp);
    cout<<n+m-1<<endl;
    for(int i = 1; i<n;i++){
        cout<<a[i].x<<" "<<a[i].y<<" "<<a[i+1].x<<" "<<a[i+1].y<<" "<<a[i].count<<endl;
        a[i+1].count+=a[i].count;
    }
    currPos=a[n];
     for(int j=1;j<=m;j++)
    {
        double min = 1e18+7;
        int idx = 0;
        for(int i = 1; i<=m;i++)
        {
            if(!used[i])
            {
                double r = sqrt((currPos.x - b[i].x)*(currPos.x - b[i].x) + (currPos.y - b[i].y)*(currPos.y - b[i].y));
                if(r < min)
                {
                    min = r;
                    idx = i;
                }
            }
        }
        used[idx] = 1;
        cout<<currPos.x<<" "<<currPos.y<<" "<<b[idx].x<<" "<<b[idx].y<<" "<<currPos.count<<endl;
        double now = (currPos.count*currPos.count - (b[idx].count*b[idx].count));
        currPos.count = ceil(sqrt(now));
        currPos.x = b[idx].x;
        currPos.y = b[idx].y;
    }
}

int main(){
    freopen("war.in","r",stdin);
    freopen("war.out","w",stdout);
    read();
    return 0;
}