Problem Statement

The Dynasty Of Capybara Cheems & Doge, are two brilliant twin rulers of the capybara dynasty. One day, while cooking, they decided to analyze some information about their salaried employees. The salaried class in their dynasty is divided into multiple levels based on the pay grade. They already know the list of possible levels and the starting and ending salary for each level. An employee fits a level if their salary lies in the start and end limit (both inclusive) of that level. An employee can lie in multiple salary levels too. Given an integer k, the number of levels, and Ai and Bi being the minimum and maximum salary of level i, also given integer n, the number of employees, and Si being the salary of the i-th employee. Help find them the level with the highest number of employees. If there are multiple such levels, report the level with the minimum index. In case no employee belongs to any of the given salary bands, answer is always 1. Input Format First line contains k, n. Ne