B'We are going to build a new city: the Metropolis. The city is going to be built on an infinite square grid. The finished city will consist of n skyscrapers, each occupying a different cell of the grid. At any moment during the construction, the cells that currently do not contain a skyscraper are called empty. You are given the planned coordinates of the n skyscrapers. Your task is to find an order in which they can be built while satisfying the rules listed below. If a solution exists, let 's denote the numbers of skyscrapers in the order in which they should be built by s_1, ... , s_n . There are two types of subtasks: Type 1: You may produce any valid order. Type 2: You must find the order that maximizes s_n . Among those, you must find the one that maximizes s_{n-1} . And so on. In other words, you must find the valid order of building for which the sequence (s_n,s_{n-1}, ... ,s_1) is lexicographically largest. The first line contains a single integer n ( 1 <= n <= 150,000 ) xe2 x80 x93 the number of skyscrapers. The second line contains a single integer t ( 1 <= t <= 2 ) describing the type of the subtask as defined above. Then, n lines follow. The i -th of these lines contains two space-separated integers r_i and c_i ( |r_i|, |c_i| <= 10^9 ) denoting the coordinates of the cell containing skyscraper i . (The skyscrapers are not numbered in any particular order. The only reason why they have numbers is that they are used in the output format.) It is guaranteed that no two skyscrapers coincide. If it is impossible to build the skyscrapers according to the given rules, print a single line containing the string "NO". Otherwise, print n+1 lines. The first of these lines should contain the string "YES". For each i , the i -th of the remaining n lines should contain a single integer s_i . In subtasks with t = 1 , if there are multiple valid orde'...