Calendars

You manage trade between two tribes, the Arbuzans and the Bananits. The trouble is that the two tribes use different calendars.

The Arbuzan calendar has $n$ months whose lengths, in days, are $a_1, a_2, \dots, a_n$. The Bananit calendar has $m$ months whose lengths are $b_1, b_2, \dots, b_m$.

A year has the same number of days in both calendars, that is $a_1 + a_2 + \dots + a_n = b_1 + b_2 + \dots + b_m$.

Write a program that converts dates between the Arbuzan and the Bananit calendars.

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 10^6$), separated by a single space, the number of months in the Arbuzan and the Bananit calendars.

The second line contains the integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^3$), separated by single spaces, the lengths of the consecutive months of the Arbuzan calendar. The third line contains the integers $b_1, b_2, \dots, b_m$ ($1 \le b_i \le 10^3$), separated by single spaces, the lengths of the consecutive months of the Bananit calendar.

The fourth line contains a single integer $z$ ($1 \le z \le 10^5$), the number of queries.

Each of the next $z$ lines describes one query. It consists of two integers $d_i$ and $m_i$ and one character $c_i$, separated by single spaces, giving the day, the month, and the direction of conversion. If $c_i$ is the letter A, then $1 \le m_i \le n$ and $1 \le d_i \le a_{m_i}$, and the pair denotes a date in the Arbuzan calendar that your program must convert to the Bananit calendar. If $c_i$ is the letter B, then $1 \le m_i \le m$ and $1 \le d_i \le b_{m_i}$, and the pair denotes a date in the Bananit calendar that your program must convert to the Arbuzan calendar.

Print $z$ lines. The $i$-th line must contain the answer to the $i$-th query as two integers $d^{\prime}_i$ and $m^{\prime}_i$ separated by a single space, where $d^{\prime}_i$ is the day and $m^{\prime}_i$ is the month of the converted date in the target calendar.