#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int t;
cin>>t;
while(t–){
ll n,min,max;
cin>>n>>min>>max;
vector<pair<ll,ll>>V;
ll w,b;
for(int i=0;i<n;i++){
cin>>w>>b;
V.push_back(make_pair(w,b));
}
ll total,count=0;
bool even=false;
bool odd=false;
for(int i=1;i<3;i++){
total=i;
if(i%2==0){
even=true;
odd=false;
}else{
even=false;
odd=true;
}
for(ll j=0;j<n;j++){
if(even){
if(V[j].second%2==0){
odd=false;
}else{
odd=true;
even=false;
}
}
else if(odd){
if(((V[j].first%2==0)&&(V[j].second%2==0)) || ((V[j].first%2!=0)&&(V[j].second%2!=0)) ){
odd=false;
even=true;
}else{
even=false;
}
}
// total = (total*V[j].first)+V[j].second;
}
if(even)
count++;
}
ll spammer,nonspamer;
if(count==1){
ll total=(max-min+1);
if(min%2!=0)
spammer=ceil(float(total)/2);
else{
spammer=floor(float(total)/2);
}
nonspamer= total - spammer;
cout<<nonspamer<<" “<<spammer<<endl;
}else if(count==0){
cout<<0<<” “<<(max-min+1)<<endl;
}else if(count==2){
cout<<(max-min+1)<<” "<<0<<endl;
}
}
}