Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65535/32768 K (Java/Others)

ZZY has many habits like seeing movie, listening music, playing PC game and football and so on. Besides he has many goals, as not every habit is good for achieving his goals, he falls into the dilemma of making a choice between his goals and habits.

Now ,we define the effect that one habit has on each goal is represented as a vector,and the elements of the vector are integers,ex.vector(100,90,-10,80)means it has 100 point effect on goal 1,90 point effect on goal 2,-10 point effect on goal 3 and 80 point effect on goal 4(the positive point means good effect and the negative point means bad effect),and the given requirement of each goal is represented as integer.please help ZZY to achieve his goals as well as keeps his habits as many as possible.

Now ,we define the effect that one habit has on each goal is represented as a vector,and the elements of the vector are integers,ex.vector(100,90,-10,80)means it has 100 point effect on goal 1,90 point effect on goal 2,-10 point effect on goal 3 and 80 point effect on goal 4(the positive point means good effect and the negative point means bad effect),and the given requirement of each goal is represented as integer.please help ZZY to achieve his goals as well as keeps his habits as many as possible.

There are multi cases , read the data until EOF.( No more than 10 cases )

Line 1: The number of ZZY’s goals N(0<N<=20)

Line 2: The requirement of each goals (0 < w <= 1000)

Line 3: The number of ZZY’s habits M(0 < M <= 16)

Line 4-M+4: Each line contains N integers, the i^{th} integer represents the effect on i^{th} goal (-1000 <= data <= 1000).

Line 1: The number of ZZY’s goals N(0<N<=20)

Line 2: The requirement of each goals (0 < w <= 1000)

Line 3: The number of ZZY’s habits M(0 < M <= 16)

Line 4-M+4: Each line contains N integers, the i

For each case: The output is a single line that contains:

* the maximum number of habits ZZY can keep, followed by:

* a SORTED list (from smallest to largest) of the habit ZZY can keep. If more than one set of habits could meet the requirement, choose the set with the smallest habit numbers.

Just please output 0 if there is no way to achieve ZZY’s goals.

* the maximum number of habits ZZY can keep, followed by:

* a SORTED list (from smallest to largest) of the habit ZZY can keep. If more than one set of habits could meet the requirement, choose the set with the smallest habit numbers.

Just please output 0 if there is no way to achieve ZZY’s goals.

提交代码