#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct{
  int suspect;
  int place;
  int b;
  int f;
  int valid;
}witness_t;

#define MAXWITNESS 200
#define MAXSUSPECT 51

int overlap(int b0,int f0,int b1,int f1){
 return !( f0<b1 || f1<b0);//does not overlap when endpoint shorter than other beginpoint
}

int main(){
  int k,K;
  int s,W,p,t;
  witness_t w[MAXWITNESS];
  int suspectClear[MAXSUSPECT];
  int isThereSuspect;
  int i,j;

  FILE *in = fopen ("alibi.in", "r");
  fscanf (in, "%d\n", &K);

  for (k = 1; k <= K; k ++){

    memset(suspectClear,0,sizeof(suspectClear));
    fscanf(in,"%d %d %d %d",&s,&W,&p,&t);

    for (i = 0; i < W; i ++){
      fscanf(in,"%d %d %d %d",&w[i].suspect,&w[i].place,&w[i].b,&w[i].f);
      w[i].valid=1;

      for (j = 0; j < i; j ++){
        if( (w[i].suspect==w[j].suspect)&&(w[i].place!=w[j].place)&&
             overlap(w[i].b,w[i].f,w[j].b,w[j].f) ){
          w[i].valid=0;
          w[j].valid=0;
        }
      }
    }

    for (i = 0; i < W; i ++){
      if((w[i].valid)&&(overlap(w[i].b,w[i].f,t,t)))//suspect is innocent
        suspectClear[w[i].suspect]=1;//index suspect by 1 to s, not 0
    }

    isThereSuspect=0;
    for (i = 1; i <= s; i ++){
      if(suspectClear[i]==0){isThereSuspect=1;}
    }

    printf ("Data Set %d:\n", k);
    if(isThereSuspect){
      for (i = 1; i <= s; i ++){
        if(suspectClear[i]==0)printf("%d\n", i);
      }

    }
    else printf ("No suspect.\n");
    printf ("\n");
  }

  fclose (in);
  return 0;
}