#include<bits/stdc++.h>
#define ll long long
#define i28 __int128
#define pii pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
int n;
struct Node{ll a,b;}c[3030];
bool operator<(Node a,Node b){
	return ((i28)a.a*(i28)b.b<(i28)a.b*(i28)b.a);
}
int p[3030];
bool cmp(int a,int b){
	return c[a].b>c[b].b;
}
bool vis[3030];
void solve(){
	ll sa=0,sb=0;
	for(int i=1;i<=n;++i)scanf("%lld%lld",&c[i].a,&c[i].b),p[i]=i,vis[i]=0,sa+=c[i].a,sb+=c[i].b;
	sort(c+1,c+n+1);i28 ans=0;
	sort(p+1,p+n+1,cmp);
	for(int i=0;i<=n;++i){
		ans=max(ans,(i28)sa*(i28)sb);
		ll Sa=sa,Sb=sb;
		for(int j=1;j<=n;++j){
			if(vis[j])continue;
			sa-=c[j].a,sb+=c[j].b;
			ans=max(ans,(i28)sa*(i28)sb);
		}
		sa=Sa,sb=Sb;
		if(i<n)vis[p[i+1]]=1,sa-=c[p[i+1]].a,sb+=c[p[i+1]].b;
	}
    stack<char>stk;while(stk.size())stk.pop();
    while(ans)stk.push((char)(ans%(i28)(10)+'0')),ans/=(i28)(10);
    while(stk.size())putchar(stk.top()),stk.pop();
    puts("");
}
int main(){
	int t;ll ta,tb;
	cin>>t>>n>>ta>>tb;
	while(t--)solve();
	return 0;
}