#include<bits/stdc++.h>

using namespace std;

struct Point
{
    long long x,y,t;
    Point(){};
    Point(long long xi, long long yi, long long ti)
    {
        x = xi;
        y = yi;
        t = ti;
    }
};

const int maxn = 5*1e4+5;
int n,m;
Point a[maxn],b[maxn];
vector<pair<Point,Point> >v;
vector<long long>ans;

bool cmp(Point p1, Point p2)
{
    if(p1.x+p1.y<p2.x+p2.y) return true;
    if(p1.x+p1.y>p2.x+p2.y) return false;
    return p1.t>p2.t;
}

void read()
{
    cin >> n >> m;
    Point nb;
    for(int i=1;i<=n;i++)
    {
        cin >> nb.x >> nb.y >> nb.t;
        a[i] = nb;
    }
    for(int i=1;i<=m;i++)
    {
        cin >> nb.x >> nb.y >> nb.t;
        b[i] = nb;
    }
    sort(a+1,a+n+1,cmp);
    sort(b+1,b+n+1,cmp);
}

bool check(int idx)
{
    long long k = idx;
    double res;
    for(int i=1;i<=m;i++)
    {
        if(k>b[i].t) k = (k*k-b[i].t*b[i].t);
        else if(k<b[i].t) return false;
        else k = 0;
        res = sqrt(k);
        res = ceil(res);
        k = res;
    }
    return true;
}

int binary_S()
{
    int l = 1, r = 5000000;
    int mid;
    while(l<=r)
    {
        mid = (l+r)/2;
        if(check(mid)) r = mid-1;
        else l = mid+1;
    }
    return l;
}

void solve()
{
    long long idx = binary_S();
    pair<Point,Point>p;
    for(int i=2;i<=n;i++)
    {
        p.first = a[i];
        p.second = a[1];
        v.push_back(p);
        if(a[1].t+a[i].t<idx)
        {
            a[1].t += a[i].t;
            ans.push_back(a[i].t);
        }
        else
        {
            ans.push_back(idx-a[1].t);
            a[1].t = idx;
            break;
        }
    }
    long long k = a[1].t;
    double res;
    for(int i=1;i<=m;i++)
    {
        p.first = a[1];
        p.second = b[i];
        a[1].x = b[i].x;
        a[1].y = b[i].y;
        v.push_back(p);
        ans.push_back(k);
        k = (k*k-b[i].t*b[i].t);
        res = sqrt(k);
        res = ceil(res);
        k = res;
    }
    int sz = v.size();
    cout << sz << endl;
    for(int i=0;i<sz;i++)
    {
        cout << v[i].first.x << " " << v[i].first.y << " " << v[i].second.x << " " << v[i].second.y << " " << ans[i] << endl;
    }
}

int main()
{
    #ifdef ONLINE_JUDGE
    freopen("war.in", "r", stdin);
    freopen("war.out", "w", stdout);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	read();
	solve();
    return 0;
}