#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <map>
using namespace std;

typedef long long ll;
const double pi=acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll mod=998244353;
const int maxn=50050;
const ll N=11;
const double pai=3.14159265358979;
const ll maxn2=1e3+2;
#define mem(a,b) memset(a,b,sizeof(a))
int main()
{
    int t,n,m,x,y,tmp,ans,sum;
    scanf("%d",&t);
    while(t--)
    {
        sum=inf;
        scanf("%d %d",&n,&m);
        for(int i=1;i<=n;++i)
        {
            tmp=0;
            scanf("%d %d",&x,&y);
            if(m%x!=0)tmp++;
            tmp+=m/x;
            ans=tmp*y;
            sum=min(sum,ans);
        }
        printf("%d\n",sum);
    }
    return 0;
}