Problem: Brian the Rabbit adores chess. Not long ago he argued with Stewie the Rabbit that a knight is better than a king. To prove his point he tries to show that the knight is very fast but Stewie doesn't accept statements without evidence. He constructed an infinite chessboard for Brian, where he deleted several squares to add some more interest to the game. Brian only needs to count how many different board squares a knight standing on a square with coordinates of (0, 0) can reach in no more than k moves. Naturally, it is forbidden to move to the deleted squares.

Brian doesn't very much like exact sciences himself and is not acquainted with programming, that's why he will hardly be able to get ahead of Stewie who has already started solving the problem. Help Brian to solve the problem faster than Stewie.

Input

The first line contains two integers k and n (0 ≤ k ≤ 1018, 0 ≤ n ≤ 440) which are correspondingly the maximal number of moves a knight can make and the number of deleted cells. Then follow n lines, each giving the coordinates of a deleted square in the form (xi, yi) (|xi| ≤ 10, |yi| ≤ 10). All the numbers are integer, the deleted squares are different and it is guaranteed that the square (0, 0) is not deleted.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Output

You must print the answer on a single line. As it can be rather long, you should print it modulo 1000000007.

Examples

Input

1 0


Output

9


Input

2 7
-1 2
1 2
2 1
2 -1
1 -2
-1 -2
-2 -1


Output

9

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int mp[2003][2003];
int ans[600];
const int mod = 1e9 + 7;
int dirx[] = {1, 1, -1, -1, 2, 2, -2, -2};
int diry[] = {2, -2, 2, -2, 1, -1, 1, -1};
struct sxd {
  int x, y;
};
queue<sxd> Q;
int n;
long long k;
long long cnt;
inline void bfs(int x, int y) {
  mp[x][y] = 1;
  Q.push((sxd){x, y});
  while (!Q.empty()) {
    sxd tmp = Q.front();
    Q.pop();
    ans[mp[tmp.x][tmp.y]]++;
    if (ans[mp[tmp.x][tmp.y]] == mod) ans[mp[tmp.x][tmp.y]] = 0;
    if (mp[tmp.x][tmp.y] > k + 1 || mp[tmp.x][tmp.y] > 500) break;
    for (int i = 0; i < 8; ++i) {
      int tx = tmp.x + dirx[i];
      int ty = tmp.y + diry[i];
      if (mp[tx][ty]) continue;
      mp[tx][ty] = mp[tmp.x][tmp.y] + 1;
      Q.push((sxd){tx, ty});
    }
  }
}
signed main() {
  cin >> k >> n;
  for (int i = 1, x, y; i <= n; ++i) {
    cin >> x >> y;
    x += 1001;
    y += 1001;
    mp[x][y] = 1;
  }
  bfs(1001, 1001);
  if (k < 500) {
    for (int i = 1; i <= k + 1; ++i) cnt = (cnt + ans[i]) % mod;
    cout << cnt << endl;
  } else {
    long long inc = ans[500] - ans[499];
    k -= 498;
    k %= mod;
    for (int i = 0; i <= 499; ++i) cnt = (cnt + ans[i]) % mod;
    cout << (((k * ans[500] % mod + cnt) % mod +
              (k * (k - 1) >> 1) % mod * inc % mod) %
                 mod +
             mod) %
                mod
         << endl;
  }
  return 0;
}