n,t=map(int,input().split())
ans=[]
for i in range(n):
t1,d=map(int,input().split())
if t1>=t:
ans.append((t1-t,i+1))
else:
ans.append((((t-t1-1)//d+1)*d+t1-t,i+1))
print(sorted(ans)[0][1])#include <bits/stdc++.h>
using namespace std;
int main(){
int n, t;
scanf("%d %d", &n, &t);
pair<int, int> l[n];
for(int i = 0; i < n; i++){
scanf("%d %d", &l[i].first, &l[i].second);
}
auto cal = [&](int i){
auto [x, v] = l[i];
if(x > t) return x;
else{
return x + ((t - x + v - 1) / v) * v;
}
};
int i = 0;
for(int j = 1; j < n; j++){
if(cal(j) < cal(i)){
i = j;
}
}
printf("%d\n", i + 1);
return 0;
}
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |