Sereja adores trees. Today he came up with a revolutionary new type of binary root trees. His new tree consists of n levels, each vertex is indexed by two integers: the number of the level and the number of the vertex on the current level. The tree root is at level 1 , its index is (1, 1) . Here is a pseudo code of tree construction. After the pseudo code is run, cell cntlevel contains the number of vertices on level level . Cell leftlevelposition contains the number of the vertex on the level level + 1 , which is the left child of the vertex with index ( level , position ) , or it contains -1, if the vertex doesn't have a left child. Similarly, cell rightlevelposition is responsible for the right child. You can see how the tree with n = 4 looks like in the notes. Serja loves to make things complicated, so he first made a tree and then added an empty set A ( level , position ) for each vertex. Then Sereja executes m operations. Each operation is of one of the two following types: The format of the operation is " 1 t l r x ". For all vertices level , position ( level = t ; l ≤ position ≤ r ) add value x to set A ( level , position ) . The format of the operation is " 2 t v ". For vertex level , position ( level = t , position = v ) , find the union of all sets of vertices that are in the subtree of vertex ( level , position ) . Print the size of the union of these sets. Help Sereja execute the operations. In this problem a set contains only distinct values like std::set in C++. The first line contains integers n and m (1 ≤ n , m ≤ 7000) . Next m lines contain the descriptions of the operations. The operation of the first type is given by five integers: 1 t l r x (1 ≤ t ≤ n ; 1 ≤ l ≤ r ≤ cnt t ; 1 ≤ x ≤ 10 6 ) . The operation of the second type is given by three integers: 2 t v (1 ≤ t ≤ n ; 1 ≤ v ≤ cnt t ) . For each operation of the second type, print the answer on a single line. You can find the definitions that are used while working with