Problem Description

You are given a chessboard of size n×n. It is filled with numbers from 1 to n^2 in the following way: the first ⌈n^2/2⌉ numbers from 1 to ⌈n^2/2⌉ are written in the cells with even sum of coordinates from left to right from top to bottom. The rest n^2−⌈n^2/2⌉ numbers from ⌈n^2/2⌉+1 to n^2 are written in the cells with odd sum of coordinates from left to right from top to bottom. The operation ⌈x/y⌉ means division x by y rounded up.

For example, the left board on the following picture is the chessboard which is given for n=4 and the right board is the chessboard which is given for n=5n=5. You are given q queries. The i-th query is described as a pair xi,yixi,yi. The answer to the i-th query is the number written in the cellxi,yi (xi is the row, yi is the column). Rows and columns are numbered from 1 to n.

Input

The first line contains two integers n and q (1≤n≤109, 1≤q≤105) — the size of the board and the number of queries.

The next q lines contain two integers each. The i-th line contains two integers xi,yi (1≤xi,yi≤n) — description of the i-th query.

Output

For each query from 1 to q print the answer to this query. The answer to the i-th query is the number written in the cell xi,yi (xixi is the row, yi is the column). Rows and columns are numbered from 1 to n. Queries are numbered from 1 to q in order of the input.

Examples

Input

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

Output

1
8
16
13
4

Input

5 4
2 1
4 2
3 3
3 4

Output

16
9
7
20

————————————————————————————————————————————

Source Program

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<ctime>
#include<vector>
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define N 1001
#define MOD 1e9+7
#define E 1e-6
#define LL long long
using namespace std;
int main()
{
LL n,t;
cin>>n>>t;
while(t--)
{
LL x,y;
cin>>x>>y;

LL ans=(x-1)*n+y+1;
if((x+y)%2)
ans+=n*n;
cout<<ans/2<<endl;
}

return 0;
} 