Problem: You are involved in the development of a certain game. The game is for players to explore randomly generated dungeons.

There are n rooms in the dungeon generated by this game, and they are numbered from 0 to n-1. The rooms are connected by a passage. There are m passages connecting rooms. The passage can go in either direction. In addition, a distance is set between the rooms. In the generated dungeon, it is possible to go from one room to all other rooms via several passages. Then, when the player plays the game, the 0th room is selected as the starting point and the n-1th room is selected as the goal point.

I want to set up a treasure chest in some room with items that will help users explore the dungeon. At that time, it is meaningless if it is too far from the starting point or too close to the goal point. Therefore, we would like to make a room that takes at least fg as a candidate for installing a treasure chest when we reach within the distance fs from the start and take the shortest path to reach the goal.

Given the generated dungeon and q. For q queries, count the number of candidate locations for treasure chests.



Input

The input is given in the following format.


n m
a1 b1 c1
..
..
..
am bm cm
q
fs1 fg1
..
..
..
fsq fgq


ai bi ci means that the distance of the passage connecting the rooms ai and bi is ci.

Input meets the following constraints
2 ≤ n ≤ 100,000
0 ≤ ai, bi <n
0 ≤ ci ≤ 100,000
n-1 ≤ m ≤ 100,000
1 ≤ q ≤ 100,000
0 ≤ fsi, fgi ≤ 260

Output

Print the answer value on one line for each query

Example

Input

4 4
0 1 3
1 3 4
0 2 2
2 3 1
4
0 0
2 2
2 1
3 4


Output

1
1
2
1

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef pair< int64, int64 > Pi;
struct edge
{
  int to, cost;
};
const int64 INF = 1LL << 60;

struct BinaryIndexedTree
{
  vector< int > data;
  BinaryIndexedTree(int sz)
  {
    data.assign(++sz, 0);
  }
  int Query(int k)
  {
    int ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return(ret);
  }
  void Add(int k, int x)
  {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};

int N, M;
vector< edge > graph[100000];

int64 Dijkstra(int s, vector< int64 >& min_cost)
{
  priority_queue< Pi, vector< Pi >, greater< Pi > > Que;
  min_cost.assign(N, INF);
  Que.push(Pi(0, s));
  min_cost[s] = 0;
  while(!Que.empty()) {
    Pi p = Que.top(); Que.pop();
    if(min_cost[p.second] < p.first) continue;
    for(auto e : graph[p.second]) {
      if(p.first + e.cost < min_cost[e.to]) {
        min_cost[e.to] = p.first + e.cost;
        Que.push(Pi(min_cost[e.to], e.to));
      }
    }
  }
  return(-1);
}


int main()
{
  scanf("%d %d", &N, &M);
  for(int i = 0; i < M; i++) {
    int A, B, C;
    scanf("%d %d %d", &A, &B, &C);
    graph[A].push_back((edge){B, C});
    graph[B].push_back((edge){A, C});
  }

  vector< int64 > toS, toG;
  Dijkstra(0    , toS);
  Dijkstra(N - 1, toG);

  vector< int > Start(N);
  for(int i = 0; i < N; i++) Start[i] = i;
  sort(Start.begin(), Start.end(), [&](const int& x, const int& y) {
    return(toS[x] < toS[y]);
  });

  vector< int64 > nums(toG);
  nums.push_back(-1);
  sort(nums.begin(), nums.end());
  nums.erase(unique(nums.begin(), nums.end()), nums.end());

  int Q;
  scanf("%d", &Q);
  vector< Pi > Query(Q);
  vector< int > Priority(Q);
  for(int i = 0; i < Q; i++) {
    scanf("%lld %lld", &Query[i].first, &Query[i].second);
    Priority[i] = i;
  }
  sort(Priority.begin(), Priority.end(), [&](const int& x, const int& y) {
    return(Query[x] < Query[y]);
  });

  int ptr = 0;
  vector< int > ret(Q);
  BinaryIndexedTree bit(nums.size());
  for(int i = 0; i < Q; i++) {
    const Pi& q = Query[Priority[i]];
    for(; ptr < N && q.first >= toS[Start[ptr]]; ++ptr) {
      bit.Add(lower_bound(nums.begin(), nums.end(), toG[Start[ptr]]) - nums.begin(), 1);
    }
    int tail = lower_bound(nums.begin(), nums.end(), q.second) - nums.begin();
    ret[Priority[i]] = bit.Query(nums.size() - 1) - bit.Query(tail - 1); 
  }

  for(int i = 0; i < Q; i++) {
    printf("%d\n", ret[i]);
  }
}