merge the two treaps l and r into one treap

This function calculates (a^b)%MOD */

O(log N)

O(log N)

split at the position pos, the treap rooted at current node into two treaps l and r arr[1 ... n] -> arr[1 ... pos], arr[pos+1 ... n]

Ths function subtracts two given strings of numbers*/

This function adds the two numbers a and b using grade school addition method*/

if high, calculate size of intersection of u%m,(u+d)%m,...,(u+n*d)%m with [-L+1, 0]. else, calculate size of intersection with [0, L-1].

if high, calculate size of intersection of u%m,(u+d)%m,...,(u+n*d)%m with [-L+1, 0]. else, calculate size of intersection with [0, L-1].

A[i]: number of nodes have a distance i from subtree A B[i]: number of nodes have a distance i from subtree B Update all pathes between subtree A and

This function calculates power of p in n! */