#include <bits/stdc++.h>
using namespace std;
long long int e = 1e7 + 5;
vector<long long int> p(e + 10000, 1);
void sieve() {
  long long int i, j;
  p[0] = 0;
  p[1] = 0;
  for (int i = 2; i * i < e; i++) {
    if (p[i]) {
      for (j = i * i; j < e; j += i) p[j] = 0;
    }
  }
}
vector<long long int> fact(long long int x) {
  vector<long long int> v;
  long long int i;
  if (x % 2 == 0) {
    v.push_back(2);
    while (x % 2 == 0) x /= 2;
  }
  for (i = 3; i <= sqrt(x); i += 2) {
    if (x % i == 0) {
      v.push_back(i);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 2) v.push_back(x);
  return v;
}
long long int power(long long int a, long long int n) {
  long long int result = 1;
  while (n) {
    if (n & 1) result = (result * a);
    n >>= 1;
    a = (a * a);
  }
  return result;
}
int main() {
  long long int t = 1, i, n, j, q, c, d;
  while (t--) {
    long long int n, m, k;
    cin >> n >> q;
    long long int a[n + 1][n + 1];
    c = 1;
    d = n * n;
    if (d % 2 == 0)
      d = d / 2;
    else
      d = (d + 1) / 2;
    while (q--) {
      long long int x, y;
      cin >> x >> y;
      if (n % 2 == 0) {
        if ((x + y) % 2 == 0)
          cout << (x - 1) * (n / 2) + (y + 1) / 2;
        else
          cout << d + (x - 1) * (n / 2) + (y + 1) / 2;
        cout << endl;
      } else {
        if ((x + y) % 2 == 0)
          cout << ((x - 1 + 1) / 2) * ((n + 1) / 2) + (y + 1) / 2 +
                      ((x - 1) / 2) * (n / 2);
        else
          cout << d + ((x - 1 + 1) / 2) * (n / 2) + (y + 1) / 2 +
                      ((x - 1) / 2) * ((n + 1) / 2);
        cout << endl;
      }
    }
  }
}
