#include<bits/stdc++.h>
#define x first
#define y second
#define endl '\n'
#define cin fin
#define cout fout
using namespace std;
ifstream fin("war.in");
ofstream fout("war.out");
void fast()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
const int maxn = 50006;
const int maxq = 2500;///!
struct Command
{
    int x,y,x2,y2,q;
};
vector <Command> ans;
struct Obekt
{
    int x,y,br,id;
};
Obekt kuli[maxn],voinici[maxn],voinici2[maxn];
int order[maxn];
int i,j,p,q,n,m,k,sum,mid,l,r;
int nach;
long long Dist(int x,int y,int x2,int y2)
{
    long long d = (x-x2)*1ll*(x-x2)+(y-y2)*1ll*(y-y2);
    return d;
}
void read()
{
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>voinici[i].x>>voinici[i].y>>voinici[i].br;
        sum+=voinici[i].br;
        voinici[i].id=i;
    }
    for(i=1;i<=m;i++)
    {
        cin>>kuli[i].x>>kuli[i].y>>kuli[i].br;
        kuli[i].id=i;
    }
}
void print()
{
    cout<<ans.size()<<endl;
    for(auto i:ans)
        cout<<i.x<<" "<<i.y<<" "<<i.x2<<" "<<i.y2<<" "<<i.q<<endl;
}
void construct_path()
{
    p = 1;
    order[1]=1;
    set <int> s;
    int d = 1;
    for(i=2;i<=m;i++)
        s.insert(i);
    while(!s.empty())
    {
        long long mn = LLONG_MAX;
        k = -1;
        int br = 0;
        for(auto i:s)
        {
            if(i==p)continue;
            long long tek = Dist(kuli[i].x,kuli[i].y,kuli[p].x,kuli[p].y);
            if(tek<mn)
            {
                k=i;
                mn = tek;
            }
            br++;
            if(br>maxq)
                break;
        }
        order[++d] = k;
        s.erase(k);
        p = k;
    }
    /**
    for(i=1;i<=m;i++)
        cout<<order[i]<<" ";
    cout<<endl;
    */
}
void find_for_first()
{
    l=1;r=sum;
    int ans = 0;
    while(l<=r)
    {
        mid = (l+r)/2;
        nach = mid;
        for(i=1;i<=m;i++)
        {
            if(nach<kuli[order[i]].br)break;
            nach = ceil(sqrt(nach*1ll*nach-kuli[order[i]].br*1ll*kuli[order[i]].br));
        }
        if(i==m+1)
            r=mid-1,ans = mid;
        else l = mid+1;
    }
    nach = ans;
    //cout<<nach<<" e nachalniqt broi voinici"<<endl;
}
bool fff(Obekt a,Obekt b)
{
    long long d1 = Dist(a.x,a.y,kuli[1].x,kuli[1].y);
    long long d2 = Dist(b.x,b.y,kuli[1].x,kuli[1].y);
    return d1<d2;
}
bool fff2(Obekt a,Obekt b)
{
    long long d1 = Dist(a.x,a.y,voinici2[1].x,voinici2[1].y);
    long long d2 = Dist(b.x,b.y,voinici2[1].x,voinici2[1].y);
    return d1<d2;
}
void gather_for_first()
{
    p = 0;
    for(i=1;i<=n;i++)
        voinici2[i]=voinici[i];
    sort(voinici2+1,voinici2+n+1,fff);

    p = voinici2[1].br;

    sort(voinici2+2,voinici2+n+1,fff2);
    for(i=2;p<nach && i<=n;i++)
    {
        p+=voinici2[i].br;
        ans.push_back({voinici2[i].x,voinici2[i].y,voinici2[1].x,voinici2[1].y,voinici2[i].br});
    }
    nach = p;
}
void iterate()
{
    ans.push_back({voinici2[1].x,voinici2[1].y,kuli[order[1]].x,kuli[order[1]].y,nach});
    nach = ceil(sqrt(nach*1ll*nach-kuli[order[1]].br*1ll*kuli[order[1]].br));
    for(i=1;i<m;i++)
    {
        ans.push_back({kuli[order[i]].x,kuli[order[i]].y,kuli[order[i+1]].x,kuli[order[i+1]].y,nach});
        nach = ceil(sqrt(nach*1ll*nach-kuli[order[i+1]].br*1ll*kuli[order[i+1]].br));
    }
}
int main()
{
    fast();
    read();
    construct_path();
    find_for_first();
    gather_for_first();
    iterate();
    print();
    return 0;
}
///napravi si test s poveche kuli
/**
3 5
1 2 6
3 4 4
1 5 5
3 2 1
1 5 2
3 1 3
1 2 3
1 1 2
*/