#include <cstdio>
#include <vector>
#include <set>
using namespace std;
const int MAX_V = 100001;
int a[MAX_V][2];
void solve()
{
        int n,m;
        multiset<int> mt[9];
        scanf("%d%d",&n,&m);
        int sum = 0,ans = 0,bit = 0;
        int value ,idx, added;
        for(int i = 0; i < n; i++)
        {
                scanf("%d%d",&a[i][0],&a[i][1]);
                a[i][0] --;
                if(i - m >= 0)
                {
                        value = a[i - m][1];
                        idx = a[i - m][0];
                        added = *(mt[idx].begin()) * -1;
                        if(added == value)
                        {
                                sum -= added;
                                mt[idx].erase(-added);
                                if(mt[idx].begin() != mt[idx].end())
                                {
                                        added = *(mt[idx].begin()) * -1;
                                        sum += added;
                                }
                                else bit -= (1 << idx); 
                        }
                        else mt[idx].erase(-added);
                }
                idx = a[i][0];
                if(mt[idx].begin() == mt[idx].end())
                {
                        sum += a[i][1];
                        bit |= (1 << idx);
                }
                else{
                        added = *(mt[idx].begin()) * -1;
                        if(added < a[i][1])
                        {
                                sum += a[i][1] - added;
                        }
                }
                mt[idx].insert(-a[i][1]);
                if(bit == (1 << 9) - 1)ans = max(ans,sum);
        }
        printf("%d\n",ans);
}
int main()
{
        int T;
        scanf("%d",&T);
        while(T--)
        {

                solve();
        }
        return 0;
}