시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB0000.000%

문제

“Behold, my queen”, said the jester, “the great Bouncing Ball Bowl!” The queen boredly waved her hand and sarcastically replied: “Let the fun begin!”. And the fun begun! The jester spoke a magic word and all the colorful balls in his bowl started to roll and bounce, creating interesting pictures.

The queen watched vividly for a few minutes, but then she started to be bored again. “Just wait a moment, Your Majesty, in a minute they’ll…” started the jester, but the queen interrupted: “I’m a queen! I don’t want to wait! Can’t you just fast forward it or something?”

The jester’s box is an X × Y rectangle. The rectangle contains N small balls. At any moment, each ball is travelling at the same speed in one of the four diagonal directions.

The movement of the balls is continuous and for the purpose of this problem we may consider them to be points. When two or more balls meet, they bounce in a way described below.

Your task is to determine the state of the box at given moments in time.

Bouncing does not change the speed of the balls. Following images show how the balls bounce off each other, and also off walls. Each image can be rotated arbitrarily. For example, the first image shows that whenever two balls meet at a right angle, they bounce and depart at a right angle again. One particularly tricky case is shown in the third image.

입력

The input starts with a line containing the dimensions X and Y of the box. We will use a coordinate system with axes parallel to the sides of the box, (0,0) at one of the corners and (X,Y ) at the opposite corner.

The second line contains the number of balls N.

Each of the next N lines contains four integers x,y,vx,vy, where (x,y) are the coordinates of one ball at time 0 and (vx,vy) is its current velocity vector. (Each ball will be strictly inside the box and for each ball both vx and vy will be equal to ±1. No two balls will start at the same place.)

The following line contains the number of queen’s requests M.

On the last line there are M numbers t1,…,tM – the points in time the queen wants to see.

출력

As a solution to this problem, we expect a file with M blocks, with the i-th block describing the situation at time ti.

Each block must contain N lines, and each line must contain the x and y coordinates of one ball. The balls in each block must be sorted – primarily by to their first, secondarily by their second coordinate at that point in time.

Easy (1점)

• 1 ≤ X, Y ≤ 100
• 1 ≤ N ≤ 101
• 1 ≤ x < X
• 1 ≤ y < Y
• 1 ≤ M ≤ 20
• 1 ≤ ti ≤ 1000

Hard (2점)

• 1 ≤ X, Y ≤ 5000
• 1 ≤ N ≤ 3001
• 1 ≤ x < X
• 1 ≤ y < Y
• 1 ≤ M ≤ 10
• 1 ≤ ti ≤ 2 × 1011

예제 입력 1

6 4
4
1 2 1 1
5 2 1 1
2 1 1 -1
3 1 -1 -1
1
4


예제 출력 1

1 3
3 2
5 2
6 3


힌트

Note that the balls that start at (2,1) and (3,1) bounce off each other at a non-integer point in time.

채점 및 기타 정보

• 예제는 채점하지 않는다.