#include <algorithm>
using namespace std;

#define MAXN  100005
 

typedef int (*PF)(const int , const int ) ;

int V[100005];

int V[MAXN];

deque <int> min_deq, max_deq;

int main(void)
{
    ifstream in("sir.in");  ofstream out("sir.out");

    int N, X, Y, Z;

    int n, X, Y, Z;

    int length = 0, start, stop, j = 0;

    in >> N >> X >> Y >> Z;
    for (int i = 1; i <= N; ++ i) {

    in >> n >> X >> Y >> Z;
    for (int i = 1; i <= n; ++ i) {

        in >> V[i];
        push_in(min_deq, i, min_fct);
        push_in(max_deq, i, max_fct);