#include <stdio.h>  

#include <string.h>  

#include <algorithm>  

#include <math.h>  

#include <queue>  

#define dist(a, b) sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y))  

#define cross(a, b, c) (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x)  

#define dot(a, b, c) (b.x - a.x) * (c.x - a.x) + (b.y - a.y) * (c.y - a.y)  

#define delt(a) fabs(a)<eps ? 0 : a> 0 ? 1 : -1  

#define pi acos(-1.0)  

#define eps 1e-8  

#define inf 1e20  

#define N 1005  

using namespace std;

int n, m, t, nl, ml;

struct TPoint  

{

    double x, y;

}pt[N], st;

void scan()  

}

double getang(TPoint a, TPoint b)  

}

void solve()  

}

int main()  

}