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

const int MAXN = 50001;
int n, m;
struct El{
    int x, y, st;
};
El u[MAXN], v[MAXN];

bool sortfunc(El a1, El a2) { return (a1.x < a2.x ||(a1.x == a2.x && a1.y < a2.y)); }

int main()
{
    freopen("war.in", "r", stdin);
    freopen("war.out", "w", stdout);
    int i, j;
    long long midx = 0, midy = 0;
    cin>>n>>m;
    for(i=1;i<=n;i++) {
        cin>>u[i].x>>u[i].y>>u[i].st;
        midx+= u[i].x;
        midy+= u[i].y;
    }
    for(i=1;i<=m;i++) {
        cin>>v[i].x>>v[i].y>>v[i].st;
        midx+= v[i].x;
        midy+= v[i].y;
    }
    midx/= (n+m); midy/= (n+m);
    cout<<n+m<<endl;
    long long war = 0;
    for(i=1;i<=n;i++) {
        cout<<u[i].x<<" "<<u[i].y<<" "<<midx<<" "<<midy<<" "<<u[i].st<<"\n";
        war+= u[i].st;
    }
    sort(v+1, v+m+1, sortfunc);
    for(i=1;i<=m;i++) {
       cout<<midx<<" "<<midy<<" "<<v[i].x<<" "<<v[i].y<<" "<<war<<"\n";
       long long kor = sqrt(war*war - v[i].st*v[i].st);
       if(kor*kor <  war*war - v[i].st*v[i].st) kor++;
       war = kor;
       midx = v[i].x; midy = v[i].y;
    }

    return 0;
}