#include<bits/stdc++.h>
using namespace std;
constexpr int N=1e5+5;
typedef long long ll;
inline void solve(){
    int n,m;
    cin>>n>>m;
    unordered_map<int,int> mp;
    vector<vector<int>> v(m+1,vector<int>());
    for(int i=1,x,y;i<=n;i++) cin>>x>>y,mp[x]=max(mp[x],y);
    for(auto [x,y]:mp){
        for(int i=1;i<=m;i+=x,y=-y) v[i].push_back(y);
    }
    multiset<int> ms;ms.insert(0);
    for(int i=1;i<=m;i++){
        for(auto z:v[i]){if(z<0) ms.erase(ms.find(-z));else ms.insert(z);}
        cout<<*ms.rbegin()<<' ';
    }
    cout<<'\n';
}
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;cin>>t;
    for(int _=1;_<=t;_++)cout<<"Case #"<<_<<": ",solve();
}