Given an array of n integers. Initially, all elements are zero. You are asked to complete q queries of two kinds:

1 x y l r: for each i in range [x, y] flip the l-th bit to r-bit of i-th element.

2 x y: check if x-th element equals y-th element.

Input Format

The first line contains an integer T denoting the number of test cases. Each test case is described as follow:

A line contains two space-separated integers n, q denoting the size of array and the number of queries. q queries follow are described as in the statement.

Output Format

For each query of kind 2, output a single line contains "YES" if two numbers are equal, otherwise "NO".

Constraints

• 1 ≤ T ≤ 100
• 1 ≤ n ≤ 10⁵
• 1 ≤ q ≤ 10⁵
• 1 ≤ sum of n over all test cases ≤ 2.10⁵
• 1 ≤ sum of q over all test cases ≤ 2.10⁵
• 1 ≤ x ≤ y ≤ n
• 0 ≤ l ≤ r ≤ 10⁹