H - Course recommendation Gym - 102299H （模拟，大坑题）

One of the biggest challenges in an online course platform is to recommend to a student one of its over 800 courses.

For instance, João took courses on Java and Java for the Web, with grades 10 and 9, respectively. What should he be recommended next? If we recommend him something much easier, much harder, or simply something that does not go with his profile, we will waste his time. Just as an undergraduate student is very careful for choosing the appropriate courses and not waste a semester due to poor choices, we wish to help students in this platform to make the best choices.

In this problem, we have (N) students and (M) courses. Students are numbered from 1 to (N), the courses from (1) to (M). For each student, we know which courses he or she already took and the respective grades. To recommend a course to a student, we first find another student who is closest to him or her. The distance between two students is defined as the euclidean distance between the grades of the courses both students took. If there are no shared courses, the distance is defined as infinity. Among the courses already taken by the closest student, we recommend the course with the highest grade which was not already taken by the original student. In case of a tie, recommend the course with the smallest index. If the original student already took all the courses that were taken by his closest student, no recommendation is make.

Your task is to code a program that recommend a course to all the students in the platform.

Input

The first line has two integers NN and MM, the number of students and courses, respectively. After this there are (N) blocks of lines, each one contains a line with an integer (Q_i), the amount of courses already taken by the (i)th student, and then (Q_i) lines, each one containing two integers (c) and (g), which indicate that the (i)th student got grade (g) for course (c).

Constraints

• 2≤N≤1002≤N≤100
• 1≤M≤1001≤M≤100
• 1≤Qi,c≤M1≤Qi,c≤M
• 0≤g≤100≤g≤10
• You may assume that each student has already taken at least one course that another student took.

Output

Print (N) lines, where the (i)th line has the course recommended to the (i)th student. If student (i) has already taken all courses that his closest student already took, print (-1).

Examples

Input

2 3
2
1 10
2 10
2
2 9
3 5

Output

3
1

Input

2 4
3
1 7
2 8
3 10
3
4 10
2 9
1 5

Output

4
3

Note

In the first example, the distance between students is given by (10−9)2−−−−−−−√(10−9)2

In the second, it is given by (7−5)2+(8−9)2−−−−−−−−−−−−−−−√

代码：

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#include <vector>
#include <bits/stdc++.h>
#define Max INT_MAX
#define inf 0x3f3f3f3f3f3f3f3f
//https://paste.ubuntu.com/
//https://www.cnblogs.com/zzrturist/    //博客园
//https://blog.csdn.net/qq_44134712     //csdn

using namespace std;
const int N=5e5+10;
typedef long long ll;
const int mod=1e9+7;

struct node{
    int sum[110];
    int num[110];
};

node n[110];
int m[110];

int main()
{
    int a,b,i,x,y;
    cin >> a >> b;
    for(int i=1;i<=a;i++){
        memset(n[i].sum,0,sizeof(n[i].sum));
        memset(n[i].num,0,sizeof(n[i].num));
    }
    memset(m,0,sizeof(m));
    for(i=1;i<=a;i++){
        cin >> x;
        for(int j=1;j<=x;j++){
            cin >> y;
            n[i].num[y]=1;
            cin >> n[i].sum[y];
        }
    }
    for(int i=1;i<=a;i++){
        int mi=inf;
        int t=0;
        for(int j=1;j<=a;j++){
            if(i!=j){
                int sum=-1;
                int flag=0;
                for(int k=1;k<=b;k++){
                    if(n[i].num[k]&&n[j].num[k]){
                        if(flag==0){
                            sum++;
                            flag=1;
                        }
                        sum+=(n[i].sum[k]-n[j].sum[k])*(n[i].sum[k]-n[j].sum[k]);
                    }
                }
                if(sum>=0&&mi>sum){
                    mi=sum;
                    t=j;
                }
            }
        }
        int ma=-1;
        int flag=0;
        int g;
        for(int k=1;k<=b;k++){
           if(n[t].num[k]&&!n[i].num[k])
           {
              flag=1;
              if(n[t].sum[k]>ma)
              {
                  ma=n[t].sum[k];
                  g=k;
              }
           }
        }
        if(flag==0){
           g=-1;
        }
        m[i]=g;
    }
    for(int i=1;i<=a;i++){
        cout << m[i] << endl;
    }
    return 0;
}