//二分整数模板
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
int a[100001][2];
int n,m;
bool check(int mid){
int ans = 0;
for(int i = 0;i < n;i)
ans += (a[i][0]/mid)*(a[i][1]/mid);
return ans >= m;
}
int main(){
cin>>n>>m;
for(int i = 0;i < n;i)
cin>>a[i][0]>>a[i][1];
int l = 1;
int r = 1e5;
while(r > l){
int mid = (r + l + 1)/2;
if(check(mid)) l = mid;
else
r = mid-1;
}
cout<<l;
return 0;
}