B'There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi. Squirrel Liss chooses some balls and makes a new sequence without changing the relative order of the balls. She wants to maximize the value of this sequence. The value of the sequence is defined as the sum of following values for each ball (where a and b are given constants): You are given q queries. Each query contains two integers ai and bi. For each query find the maximal value of the sequence she can make when a xe2 x80 x89= xe2 x80 x89ai and b xe2 x80 x89= xe2 x80 x89bi. Note that the new sequence can be empty, and the value of an empty sequence is defined as zero. The first line contains two integers n and q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105; 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89500). The second line contains n integers: v1, xe2 x80 x89v2, xe2 x80 x89..., xe2 x80 x89vn (|vi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). The third line contains n integers: c1, xe2 x80 x89c2, xe2 x80 x89..., xe2 x80 x89cn (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ci xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). The following q lines contain the values of the constants a and b for queries. The i-th of these lines contains two integers ai and bi (|ai|, xe2 x80 x89|bi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). In each line integers are separated by single spaces. For each query, output a line containing an integer -- the answer to the query. The i-th line contains the answer to the i-th query in the input order. Please, do not write the %lld specifier to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specifier. In the first example, to achieve the maximal value: Note that there may be other ways to achieve the maximal value.'...