Pixels in a digital picture can be represented with three integers $(R,G,B)$ in the range $0$ to $255$ that indicate the intensity of the red, green, and blue colors. The color of a pixel can be expressed as a six-digit hexadecimal capital string. For example, $(R=100,G=255,B=50)$ can be expressed as ''$\texttt{64FF32}$''.
There are $n$ layers in Photoshop workstation, labeled by $1,2,\dots,n$ from bottom to top. The screen will display these layers from bottom to top. In this problem, you only need to handle the case that the color of all the pixels in a layer are the same. The color of the $i$-th layer is $c_i=(R_i,G_i,B_i)$, the blending mode of the $i$-th layer is $m_i$ ($m_i\in\{1,2\}$):
- If $m_i=1$, the blending mode of this layer is ''Normal''. Assume the previous color displayed on the screen is $(R_p,G_p,B_p)$, now the new color will be $(R_i,G_i,B_i)$.
- If $m_i=2$, the blending mode of this layer is ''Linear Dodge''. Assume the previous color displayed on the screen is $(R_p,G_p,B_p)$, now the new color will be $(\min(R_p+R_i,255)$, $\min(G_p+G_i,255)$, $\min(B_p+B_i,255))$.
You will be given $q$ queries. In the $i$-th query, you will be given two integers $l_i$ and $r_i$ ($1\leq l_i\leq r_i\leq n$). Please write a program to compute the final color displayed on the screen if we only keep all the layers indexed within $[l_i,r_i]$ without changing their order. Note that the color of the background is $(R=0,G=0,B=0)$.