As is typical, Farmer John's cows have spread themselves out along his largest pasture, which can be regarded as a large 2D grid of square "cells" (picture a huge chessboard).

The pattern of cows across the pasture is quite fascinating. For every cell (x, y) with x ≥ 0 and y ≥ 0, there exists a cow at (x, y) if for all integers k ≥ 0, the remainders when ⌊x / 3k⌋ and ⌊y / 3k⌋ are divided by three have the same parity. In other words, both of these remainders are odd (equal to 1), or both of them are even (equal to 0 or 2). For example, the cells satisfying 0 ≤ x, y < 9 that contain cows are denoted by ones in the diagram below.

        x
    012345678

  0 101000101
  1 010000010
  2 101000101
  3 000101000
y 4 000010000
  5 000101000
  6 101000101
  7 010000010
  8 101000101

FJ is curious how many cows are present in certain regions of his pasture. He asks q queries, each consisting of three integers xi, yi, di. For each query, FJ wants to know how many cows lie in the cells along the diagonal range from (xi, yi) to (xi + di, yi + di) (endpoints inclusive).

Input

The first line contains q (1 ≤ q ≤ 104), the number of queries.

The next q lines each contain three integers di, xi and yi (0 ≤ xi, yi, di ≤ 1018).

Output

Print q lines, one for each query.