Scanner in=new Scanner(System.in);
int n=in.nextInt(),count=in.nextInt();
int[][]dp=new int[n][2];
double result=0;
for(int i=0;i<n;i++) {
dp[i][0]=in.nextInt();
dp[i][1]=in.nextInt();
}
Arrays.sort(dp, (dp1,dp2)->{
if(dp2[1]/dp2[0]>dp1[1]/dp1[0]) {
return 1;
}
else if(dp2[1]/dp2[0]==dp1[1]/dp1[0]) {
return (dp2[1]%dp2[0])-(dp1[1]%dp1[0]);
}
return -1;
});
