#include <stdio.h>
#include <stdlib.h>
struct Line
{int x1;int x2;int h;Line * Parent;Line * Left;Line * Right;
};Line *line;
int cmp(const void * a,const void * b)
{Line *m,*n;m=(Line *)a;n=(Line *)b;if(m->h>n->h)return -1;else if(m->h==n->h){if(m->x1>n->x1)return -1;else return 1;}else {return 1;}
}
void tree(Line * lp,int i,int n,int max)
{if(i+1<n-1){if(lp[i].x2>=lp[i+1].x2){lp[i].Left=&lp[i+1];tree(lp,i+1,n,max);if(i+2<n-1){for(int k=i+2;k<n;k++){if(lp[i].h-lp[k].h<=max){if(k==n-1){lp[i].Right=&lp[k];tree(lp,k,n,max);break;}else if(lp[i].x1<=lp[k].x1){lp[i].Right=&lp[k];tree(lp,k,n,max);break;}else {}}else{lp[i].Right=NULL;break;}}//for}else{lp[i].Right=&lp[n];}}else{lp[i].Right=&lp[i+1];tree(lp,i+1,n,max);for(int k=i+2;k<n;k++){if(lp[i].h-lp[k].h<=max){if(k==n-1){lp[i].Left=&lp[k];tree(lp,k,n,max);break;}else if(lp[i].x2>=lp[k].x2){lp[i].Left=&lp[k];tree(lp,k,n,max);break;}else{}}else{lp[i].Left=NULL;break;}}//for}}else{lp[i].Left=&lp[n];lp[i].Right=&lp[n];}
}int min(int a,int b)
{if(a<b)return a;else return b;
}int cal(Line * lp,int x)
{if(lp->Left==lp->Right){return min(lp->x2-x,x-lp->x1);}if(lp==NULL)return 10000000;return min(x-lp->x1+cal(lp->Left,lp->x1),lp->x2-x+cal(lp->Right,lp->x2));
}int main()
{int t;scanf("%d",&t);for(int i=0;i<t;i++){int n,x,y,max;int res=0;scanf("%d%d%d%d",&n,&x,&y,&max);line=new Line[n+1];for(int i=0;i<n;i++){scanf("%d%d%d",&line[i].x1,&line[i].x2,&line[i].h);}//read itemsline[n].h=0;line[n].x1=0;line[n].x2=200000000;qsort(line,n+1,sizeof(Line),cmp);//sort items by highttree(line,0,n+1,max);res=y+cal(line,x);/*for(int i=0;i<n;i++){printf("line %d\nx1=%d  x2=%d  h=%d \n",i,line[i].x1,line[i].x2,line[i].h);}*/printf("%d\n",res);delete []line;}}