Codeforces Round 333 (Div. 2)
A
Two Bases
Codeforces
1100
原题
←B →
翻译中…

After seeing the "ALL YOUR BASE ARE BELONG TO US" meme for the first time, numbers $*X*$ and $*Y*$ realised that they have different bases, which complicated their relations.

翻译中…

You're given a number $*X*$ represented in base $*b*_{*x*}$ and a number $*Y*$ represented in base $*b*_{*y*}$. Compare those two numbers.

翻译中…

Input

翻译中…

The first line of the input contains two space-separated integers $*n*$ and $*b*_{*x*}$ ($1 ≤ *n* ≤ 10$, $2 ≤ *b*_{*x*} ≤ 40$), where $*n*$ is the number of digits in the $*b*_{*x*}$-based representation of $*X*$.

翻译中…

The second line contains $*n*$ space-separated integers $*x*_{1}, *x*_{2}, ..., *x*_{*n*}$ ($0 ≤ *x*_{*i*} < *b*_{*x*}$) — the digits of $*X*$. They are given in the order from the most significant digit to the least significant one.

翻译中…

The following two lines describe $*Y*$ in the same way: the third line contains two space-separated integers $*m*$ and $*b*_{*y*}$ ($1 ≤ *m* ≤ 10$, $2 ≤ *b*_{*y*} ≤ 40$, $*b*_{*x*} ≠ *b*_{*y*}$), where $*m*$ is the number of digits in the $*b*_{*y*}$-based representation of $*Y*$, and the fourth line contains $*m*$ space-separated integers $*y*_{1}, *y*_{2}, ..., *y*_{*m*}$ ($0 ≤ *y*_{*i*} < *b*_{*y*}$) — the digits of $*Y*$.

翻译中…

There will be no leading zeroes. Both $*X*$ and $*Y*$ will be positive. All digits of both numbers are given in the standard decimal numeral system.

翻译中…

Output

翻译中…

Output a single character (quotes for clarity):

翻译中…
  • '<' if $*X* < *Y*$
  • '>' if $*X* > *Y*$
  • '=' if $*X* = *Y*$
翻译中…

Note

翻译中…

In the first sample, $*X* = 101111_{2} = 47_{10} = *Y*$.

翻译中…

In the second sample, $*X* = 102_{3} = 21_{5}$ and $*Y* = 24_{5} = 112_{3}$, thus $*X* < *Y*$.

翻译中…

In the third sample, image and $*Y* = 4803150_{9}$. We may notice that $*X*$ starts with much larger digits and $*b*_{*x*}$ is much larger than $*b*_{*y*}$, so $*X*$ is clearly larger than $*Y*$.

翻译中…

样例

Input #1
6 2
1 0 1 1 1 1
2 10
4 7
Output #1
=
InputCopy OutputCopy
Input #2
3 3
1 0 2
2 5
2 4
Output #2
<
InputCopy OutputCopy
Input #3
7 16
15 15 4 0 0 7 10
7 9
4 8 0 3 1 5 0
Output #3
>
InputCopy OutputCopy
题目信息
题号
602A
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。