#include<bits/stdc++.h>

   using namespace std;

 int rs[10011];
 void quickSort(int l, int r)
{    int x = rs[l + (r - l) / 2];
    int i = l;
    int j = r;
    while(i <= j)
    {
        while(rs[i] < x) i++;
        while(rs[j] > x) j--;
        if(i <= j)
        {
            swap(rs[i], rs[j]);
            i++;
            j--;
        }
    }
    if (i<r)
                quickSort(i, r);
    
    if (l<j)    
        quickSort(l, j);    
}
int main(){int s;
	ifstream cin("energii.in");
ofstream cout("energii.out");
	int i,g,w,p[10011],c[10011];
	cin>>g;
	cin>>w;
	for (i=1;i<=g;i++) cin>>p[i]>>c[i];
	for (i=1;i<=g;i++) rs[i]=p[i]/c[i]; 
	quickSort (1 , g);
	for (i=1;i<=g;i++) s  = + rs[i];
	cout<< s;		
	return 0;
}