#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 55;
const int INF = 1e9 + 77;
const long long INFINF = 1e18 * 2;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
vector<int> months = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long s = power(x, y / 2);
  s *= s;
  if (y % 2 == 1) s *= x;
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long fac(long long x) {
  long long p = 1;
  for (long long i = 2; i <= x; i++) {
    p *= i;
  }
  return p;
}
long long x[2 * MAX];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  int k;
  cin >> k;
  if (n & 1) {
    while (k--) {
      long long r, c;
      cin >> r >> c;
      long long how = (r - 1) * n;
      how += c;
      if (!((c + r) & 1)) {
        cout << (how + 1) / 2 << '\n';
      } else {
        long long more = ((n * n) + 1) / 2;
        how /= 2;
        cout << how + more << '\n';
      }
    }
  } else {
    while (k--) {
      long long r, c;
      cin >> r >> c;
      long long how = (r - 1) * (n / 2);
      if (!((c + r) & 1)) {
        long long more;
        if (r & 1) {
          more = (c + 1) / 2;
        } else {
          more = c / 2;
        }
        cout << more + how << '\n';
      } else {
        long long more;
        if (r & 1) {
          more = (c) / 2;
        } else {
          more = (c + 1) / 2;
        }
        cout << more + how + ((n * n) / 2) << '\n';
      }
    }
  }
  return 0;
}
