Jobs (Easy Version)

题号：NC239614
时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
Special Judge, 64bit IO Format: %lld

题目描述

See Problem N for PDF statements.

Note: The only difference between the easy and the hard version is the constraints on $n$ and $m_i$ .

Since Little Horse gets a golden prize in a programming contest, many companies send offers to him. There are $n$ companies, and the $i$ -th company has $m_i$ available jobs. To get an offer from a company, you need to be qualified for the job.

How to be qualified? The company will test your "three quotients": IQ (Intelligence Quotient), EQ (Emotional Quotient), and AQ (Adversity Quotient). Each job has three lower limits of the three quotients respectively. If all of your IQ, EQ, and AQ are no less than the corresponding lower limits, you are qualified for the job. As long as you are qualified for at least one job in a company, the company will send an offer to you.

Little Horse's three quotients are all high enough, so all the companies send offers to him. But Little Horse has $q$ friends that worry about their jobs. Given the value of IQ, EQ and AQ of each friend, Little Horse wants to know how many companies will send offers to each friend.

In this problem, the IQ, EQ, and AQ of these $q$ friends are generated as below.

First, register an $\texttt{mt19937}$ random engine $\texttt{rng}$ with the $\texttt{seed}$ and a uniform integer distribution object.

#include <random>
std::mt19937 rng(seed);
std::uniform_int_distribution<> u(1,400);

Then, the value of IQ, EQ, and AQ are generated as follows.

int lastans=0;
for (int i=1;i<=q;i++)
{
    int IQ=(u(rng)^lastans)%400+1;  // The IQ of the i-th friend
    int EQ=(u(rng)^lastans)%400+1;  // The EQ of the i-th friend
    int AQ=(u(rng)^lastans)%400+1;  // The AQ of the i-th friend
    lastans=solve(IQ,EQ,AQ);  // The answer to the i-th friend
}

输入描述:

The first line of input contains two integers  (, ), indicating the number of companies and Little Horse's friends.

Then in the next  lines, the first integer of the -th line is  () --- the number of jobs in the -th company. Then there follow  integers. The -th triple integers  () indicate the lower limits of IQ, EQ, and AQ for the -th job in the -th company.

The next line contains one integer  (). Then the IQ ,EQ, and AQ of these  friends are generated as above.

输出描述:

Let's denote the answer to the -th friend as . You should output:



in a single line.

示例1

输入

复制

3 5
2 1 1 2 2 1 2
3 1 3 2 2 3 1 2 3 3
2 2 3 1 3 2 1
191415411

输出

复制

34417749

说明

The value of IQ, EQ, and AQ of the  friends in example are shown as follows.

92 108 303
116 36 265
255 132 185
360 219 272
8 115 254

The answers to each friend are all .