Problem: <image>

After William is done with work for the day, he enjoys playing his favorite video game.

The game happens in a 2D world, starting at turn 0. William can pick any cell in the game world and spawn in it. Then, each turn, William may remain at his current location or move from the current location (x, y) to one of the following locations: (x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1).

To accelerate movement the game has n fast travel towers. i-th tower is located at location (xa_i, ya_i). To be able to instantly travel to the tower from any location in the game world it must first be activated. Activation of tower i happens at the moment when the player is in cell (xa_i, ya_i) after this the tower remains active throughout the entire game.

William also knows that the game has m quests. i-th quest can be completed instantly by being at location (xb_i, yb_i) on turn t_i.

William wants to find out the maximal number of quests he will be able to complete by optimally traversing the game world.

Input

The first line contains two integers n and m (0 ≤ n ≤ 14, 1 ≤ m ≤ 100), which are the number of towers and the number of quests, respectively.

Each of the next n lines contains two integers xa_i, ya_i (1 ≤ xa_i, ya_i ≤ 10^6), which are the coordinates of fast travel towers.

Each of the next m lines contains two integers xb_i, yb_i and t_i (1 ≤ xb_i, yb_i ≤ 10^6, 1 ≤ t_i ≤ 10^9), which are the coordinates of quests and the turn at which it may be completed.

It is guaranteed that all locations in a test are different.

Output

Print a single number — the maximal number of quests William will be able to complete.

Example

Input


3 4
1 1
2 3
5 2
2 2 12
5 1 4
6 2 11
3 5 10


Output


3

Note

In the first sample test one of the possible sequences of William's actions is as follows: 

  * Spawn at (3, 2) 
  * On turn 1 move to (4, 2) 
  * On turn 2 move to (5, 2). By visiting this cell William activates tower number 3. 
  * On turn 3 move to (5, 1), where he waits for 1 turn to complete the 2nd quest 
  * On turn 5 move to (5, 2) 
  * On turn 6 move to (5, 3) 
  * On turn 7 move to (5, 4) 
  * On turn 8 move to (5, 5) 
  * On turn 9 move to (4, 5) 
  * On turn 10 move to (3, 5). By moving to this location William will complete the 4th quest 
  * On turn 10 instantly move to an already activated fast travel tower at (5, 2) 
  * On turn 11 move to (6, 2). By moving to this location William will complete the 3rd quest 
  * William will not be able to complete the quest number 1, because the tower at (2, 3) was not activated 

Solution (in CPP):

Solution:
// Awwawa! Dis cold yis ratten buy tEMMIE!
#include <bits/stdc++.h>
#define ll long long
#define maxn (1 << 14) + 10 /*rem*/
#define mod 1000000007
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second

template <typename T> bool chkmax(T &x, T y) {
  return x < y ? x = y, true : false;
}
template <typename T> bool chkmin(T &x, T y) {
  return x > y ? x = y, true : false;
}

using namespace std;

ll ksm(ll a, ll b) {
  if (!b)
    return 1;
  ll ns = ksm(a, b >> 1);
  ns = ns * ns % mod;
  if (b & 1)
    ns = ns * a % mod;
  return ns;
}

int n, m, ans;
int x[20], y[20], reach[110];
int dp[maxn][110], act[maxn][110];
vector<array<int, 3>> task;

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", x + i, y + i);
  }
  for (int i = 0; i < m; i++) {
    int xb, yb, t;
    scanf("%d%d%d", &xb, &yb, &t);
    task.push_back({t, xb, yb});
  }
  sort(task.begin(), task.end());
  for (int S = 0; S < (1 << n); S++)
    for (int j = 0; j <= m; j++)
      act[S][j] = (1 << 30);
  act[0][0] = 0;
  for (int S = 0; S < (1 << n); S++) {
    for (int j = m - 1; j >= 0; j--)
      act[S][j] = min(act[S][j], act[S][j + 1]);
    for (int j = 0; j < m; j++) {
      reach[j] = 1 << 25;
      for (int k = 0; k < n; k++)
        if (S & (1 << k))
          reach[j] =
              min(reach[j], abs(x[k] - task[j][1]) + abs(y[k] - task[j][2]));
    }
    for (int j = 0; j < m; j++) {
      dp[S][j] = -(1 << 30);
      if (S == 0)
        dp[S][j] = 1;
      for (int k = 0; k <= j; k++)
        if (act[S][k] + reach[j] <= task[j][0])
          dp[S][j] = max(dp[S][j], k + 1);

      for (int k = 0; k < j; k++) {
        if (abs(task[j][1] - task[k][1]) + abs(task[j][2] - task[k][2]) <=
                task[j][0] - task[k][0] ||
            reach[j] <= task[j][0] - task[k][0]) {
          dp[S][j] = max(dp[S][j], dp[S][k] + 1);
        }
      }
      ans = max(ans, dp[S][j]);
    }
    for (int k = 0; k < n; k++)
      if ((S & (1 << k)) == 0) {
        int reach2 = (1 << 30);
        for (int j = 0; j < n; j++)
          if (S & (1 << j)) {
            reach2 = min(reach2, abs(x[j] - x[k]) + abs(y[j] - y[k]));
          }
        for (int j = 0; j < m; j++)
          if (dp[S][j] >= 0)
            act[S | (1 << k)][dp[S][j]] =
                min(act[S | (1 << k)][dp[S][j]],
                    task[j][0] +
                        min(abs(task[j][1] - x[k]) + abs(task[j][2] - y[k]),
                            reach2));
        if (S == 0)
          reach2 = 0;
        for (int j = 0; j < m; j++)
          act[S | (1 << k)][j] = min(act[S | (1 << k)][j], act[S][j] + reach2);
      }
  }
  printf("%d\n", ans);
}