/*
 * File:   main.cpp
 * Author: kalin
 *
 * Created on December 29, 2015, 10:18 AM
 */

#include <iostream>
#include <cmath>
#include <algorithm>    // std::next_permutation, std::sort
#include <fstream>
#include <ctime>

using namespace std;


const int MAX_TIME = 4.8 * CLOCKS_PER_SEC;

struct Point{
    int x,y;
};
int N,M;
int perm[101];
Point villages[101];
int wires[100*3-5][2];
int placed_wires[100*3-5];
int placed_wires_cnt=0;
int pointing_wires[100*3-5];
int pointing_wires_cnt=0;
int placed_plants[101];
int placed_plants_cnt=0;

struct Solution{
    int perm[101];
    int placed_plants[101];
    int cnt;
};
Solution sol;

void input(){
    ifstream in;
    in.open("electricity.in");
    in >> N >> M;

    for(int i=0; i<N; i++ ){
        in >> villages[i].x >> villages[i].y;
    }

    for(int i=0; i<M; i++){
        in >> wires[i][0] >> wires[i][1];
        wires[i][0] -= 1;
        wires[i][1] -= 1;
    }

    in.close();
}

void output(){
    ofstream out;
    out.open ("electricity.out");

    int K=0;
    for(int i=0; i<N; i++){
        K += sol.placed_plants[i];
    }
    out << K << endl;

    for(int i=0; i<N; i++){
        if( sol.placed_plants[i] ){
            out << i+1 << " " << villages[sol.perm[i]].x << " " << villages[sol.perm[i]].y << " " << sol.perm[i]+1<<endl;
        }
    }

    out.close();
}
                //Line A          //Line B
bool intersect( Point a, Point b, Point c, Point d ){
    b.x -= a.x;
    b.y -= a.y;
    d.x -= c.x;
    d.y -= c.y;

    double k,l;
    double det = d.y*b.x - b.y*d.x;
    if(det == 0) return a.x != c.x || a.y != c.y;  //lines are collinear
    else l = (double)( a.y*b.x + c.x*b.y - a.x*b.y - c.y * b.x ) / det;
    if(l <= 0 || l >= 1) return false;
    if(b.x == 0) return false;
    else k = ( c.x + l*d.x - a.x ) / b.x;
    if(k <= 0 || k >= 1) return false;
    return true;
}

bool intersectPerm(int a, int b){
    return intersect( villages[perm[wires[a][0]]],
                      villages[perm[wires[a][1]]],
                      villages[perm[wires[b][0]]],
                      villages[perm[wires[b][1]]] );
}

bool plantAt(int plant, int wire){
    Point t = villages[perm[plant]],
          a = villages[perm[wires[wire][0]]],
          b = villages[perm[wires[wire][1]]];
    b.x -= a.x;
    b.y -= a.y;

    double k=-1.0;
    if( b.x == 0 && b.y == 0 ){
        return false;
    } else if( b.x == 0 ){
        k = (double)( t.y - a.y )/b.y;
        if(abs(t.x-a.x) >= 1) return false;
    } else if( b.y == 0 ){
        k = (double)( t.x - a.x )/b.x;
        if(abs(t.y-a.y) >= 1) return false;
    } else {
        double k1 = (double)( t.y - a.y )/b.y,
               k2 = (double)( t.x - a.x )/b.x;
        if(abs(k1-k2) < 1) k = k1;
    }

    return 0 < k && k < 1;
}

void rpermute(){
    for( int i = N-1; i > 0; i--  ){
        int j = rand() % (i+1);
        int temp = perm[j];
        perm[j] = perm[i];
        perm[i] = temp;
    }
}

void init_pointing(int plant){
    pointing_wires_cnt = 0;
    for(int i=0; i<M; i++){
        if( placed_wires[i] == 0 &&
            ( ( wires[i][0] == plant && placed_plants[wires[i][1]] ) ||
              ( wires[i][1] == plant && placed_plants[wires[i][0]] )   )){
            //cout<<"pointing_wires["<<pointing_wires_cnt<<"]="<<i<<endl;
            pointing_wires[pointing_wires_cnt++] = i;
        }
    }
}

int place(int plant){
    init_pointing(plant);

    for(int i=0; i<M; i++){
        if(placed_wires[i] && plantAt(plant,i)){
          return 0;
        }
    }

    for(int i=0; i<pointing_wires_cnt; i++){
        //pointing intersect with placed
        for(int j=0; j<M; j++){
		//cout<<"checking wires:"<<
            if(placed_wires[j] && intersectPerm(pointing_wires[i], j)){
                //cout<<"wires "<<pointing_wires[i]<<" and "<<placed_wires[j]<<" intersect."<<endl;
                return 0;
            }

        }

        for(int j=0;j<N;j++){
            if(placed_plants[j] && plantAt(j, pointing_wires[i])){
                return 0;
            }
        }
    }

    //cout<<"adding plant "<<plant<<endl;
    //add plant and wires
    placed_plants[plant] = 1;
    for(int i=0; i<pointing_wires_cnt; i++){
        placed_wires[pointing_wires[i]] = 1;
    }

    return 1;
}

void calc(){
    for(int i=0;i<M;i++){
        placed_wires[i] = 0;
    }
    for(int i=0;i<N;i++){
        placed_plants[i] = 0;
    }
    int cnt = 0;
    for(int i=0;i<N;i++){
        cnt += place(perm[i]);
    }
    if(cnt > sol.cnt){
         for(int i=0;i<N;i++) sol.perm[i] = perm[i];
         for(int i=0;i<N;i++) sol.placed_plants[i] = placed_plants[i];
         sol.cnt = cnt;
	 cout<<"cnt="<<cnt<<endl;
    }
}

bool any_intersect(){
    for(int i=0;i<M;i++){
        if( placed_wires[i] ){
            for(int j=0;j<M;j++){
                if( placed_wires[j] ){
                    if(i==j) continue;
                    bool b = intersectPerm(i,j);
                    if(b){
                        cout << i << " intersects with " << j << endl;

                        //return true;

                    }
                }
            }

            for(int j=0;j<N;j++){
                if( plantAt(j,i) ){
                    cout << "plant " << j << " at " << i << endl;
                    placed_plants[j] = 0;
                    //return true;
                }
            }
        }
    }
    return false;
}

void clean_sol(){
    for(int i=0;i<N;i++){
        perm[i] = sol.perm[i];
    }
    for(int i=0;i<N;i++){
        if(sol.placed_plants[i]){
            for(int j=0;j<M;j++){
                if( plantAt( i, j ) ){
                    sol.placed_plants[i] = 0;
                    cout << "plant " << i << " at " << j << endl;
                }
            }
        }
    }
}

int main()
{
    input();

    for(int i=0;i<N;i++){
        perm[i] = i;
    }

    while( clock() < MAX_TIME ){
        rpermute();
        calc();
        if( sol.cnt == N ) break;
    }

    output();

    return 0;
}