Codeforces 724C Ray Tracing(exgcd)

C. Ray Tracing

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are located at distinct points strictly inside the rectangle.

Opposite corners of the room are located at points (0, 0) and (n, m). Walls of the room are parallel to coordinate axes.

At the moment 0, from the point (0, 0) the laser ray is released in the direction of point (1, 1). The ray travels with a speed of  meters per second. Thus, the ray will reach the point (1, 1) in exactly one second after the start.

When the ray meets the wall it's reflected by the rule that the angle of incidence is equal to the angle of reflection. If the ray reaches any of the four corners, it immediately stops.

For each sensor you have to determine the first moment of time when the ray will pass through the point where this sensor is located. If the ray will never pass through this point, print  - 1 for such sensors.

Input

The first line of the input contains three integers n, m and k (2 ≤ n, m ≤ 100 000, 1 ≤ k ≤ 100 000) — lengths of the room's walls and the number of sensors.

Each of the following k lines contains two integers xi and yi (1 ≤ xi ≤ n - 1, 1 ≤ yi ≤ m - 1) — coordinates of the sensors. It's guaranteed that no two sensors are located at the same point.

Output

Print k integers. The i-th of them should be equal to the number of seconds when the ray first passes through the point where the i-th sensor is located, or  - 1 if this will never happen.

Examples

input

3 3 4
1 1
1 2
2 1
2 2

output

1
-1
-1
2

input

3 4 6
1 1
2 1
1 2
2 2
1 3
2 3

output

1
-1
-1
2
5
-1

input

7 4 5
1 3
2 2
5 1
5 3
4 3

output

13
2
9
5
-1

Note

In the first sample, the ray will consequently pass through the points (0, 0), (1, 1), (2, 2), (3, 3). Thus, it will stop at the point (3, 3) after 3seconds.

In the second sample, the ray will consequently pass through the following points: (0, 0), (1, 1), (2, 2), (3, 3), (2, 4), (1, 3), (0, 2), (1, 1),(2, 0), (3, 1), (2, 2), (1, 3), (0, 4). The ray will stop at the point (0, 4) after 12 seconds. It will reflect at the points (3, 3), (2, 4), (0, 2),(2, 0) and (3, 1).

题意：在一个n*m的矩形中有k个点，给出这k个点的坐标。 有一个栗子从(0,0)点直线射入，1s后到达(1,1)点。碰到矩形内壁会反弹（反弹中入射角等于反射角）。问对于这k个点，栗子分别在什么时间经过，不能经过输出-1.

题解：膜了好几个dalao的写法，没有看懂怎么模拟的。大致说一下exgcd的思路吧，我们可以把这个矩形展开，让栗子在矩形中反射的路线变成一条直线。 在展开的过程中 对于每个点都有对应的通式(2kn±x , 2sm±y)，然后计算出最小的 2kn±x就可以了。 注意：我们首先要计算出栗子反射碰到矩形的四个角射出矩形的时间temp，

要求 2kn±x<temp,  否则表示该点不会被栗子经过。

不是很懂exgcd的求解过程啊，暑假又白看了，人蠢就不应该看数论，QAQ。。。。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const LL INF=2e18; 
int n,m,k;

void exgcd(LL a,LL b,LL &d,LL &x,LL &y)
{
	if(b==0){
		x=1; y=0;
		d=a;
		return ;
	}
	else{
		exgcd(b,a%b,d,y,x);
		y-=(a/b)*x;
	}
}

LL solve(int x,int y)
{
	LL N=2*n,M=2*m;
	LL X,Y,d;
	exgcd(N,M,d,X,Y);
	if((y-x)%d!=0)
		return INF; 
	LL lcm=1ll*N*M/d;
	X*=(y-x)/d;
	LL x0=X%lcm*N%lcm+x;
	x0=(x0%lcm+lcm)%lcm;
	if(x0==0)	x0+=lcm;
	return x0;
}

int main()
{
	while(scanf("%d%d%d",&n,&m,&k)!=EOF)
	{
		LL temp=min( { solve(0,0), solve(n,0), solve(0,m), solve(n,m) } );
		while(k--)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			LL tim=min({solve(x,y),solve(2*n-x,y),solve(x,2*m-y),solve(2*n-x,2*m-y)});
			if(tim<temp&&tim<INF)
				printf("%I64d\n",tim);
			else
				printf("-1\n");
		}
	}
	return 0;
}