#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
#define  oo 21474837
typedef pair<long,long> P;
struct input{
    long long int money,profit;
};
input data[21];
int n,m;
int ans;
deque<P> dp[2];
priority_queue<P,vector<P>,greater<P> >que;
int cmp(const input &a,const input &b)
{
    if(a.money==b.money)return a.profit>b.profit;
    return a.money<b.money;
}
void dynamic()
{
    int i;
    long j;
    int past=-1;
    ans=0;
    P a,b,c;
    a.first=0;
    a.second=0;
    dp[1].push_back(a);
    for(i=0;i<n;i++)
    {
        if(past>data[i].profit)continue;
        past=data[i].profit;
        a.first=data[i].money;
        a.second=data[i].profit;
        dp[i%2].clear();
        while(!dp[(i+1)%2].empty())
        {
            b=dp[(i+1)%2].front();
            dp[(i+1)%2].pop_front();
            que.push(b);
            for(j=1;;j++)
            {
                if(b.first+a.first*j>m)break;
                else
                {
                    c.first=b.first+a.first*j;
                    c.second=b.second+a.second*j;
                    que.push(c);
                }               
            }
            while(!que.empty())
            {
                c=que.top();
                if(ans<c.second)ans=c.second;
                dp[i%2].push_back(c);
                if(dp[i%2].size()>1)
                {
                    if(dp[i%2][dp[i%2].size()-2]>dp[i%2][dp[i%2].size()-1])dp[i%2].pop_back();
                }
                que.pop();

            }
        }
    }
}
int main()
{
    int C,i;
    cin>>C;
    while(C--)
    {
        cin>>n>>m;
        m/=100;
        for(i=0;i<n;i++)
        {
            cin>>data[i].money>>data[i].profit;
            data[i].money/=100;
        }   
        sort(data,data+n,cmp);
        dynamic();
        cout<<ans<<endl;

    }
    return 0;
}