N,M=map(int,input().split())
D=[]
for i in range(N):
    a,b=map(int,input().split())
    D.append((M-a)//b+1)
D.sort()
ans=max((j+D[j-1]-1)//D[j-1] for j in range(1,N+1))
print(ans)