Codeforces Round #333 (Div. 2)A. Two Bases(模拟，计算进制)

#define CF

#ifndef CF
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#else
#include<bits/stdc++.h>
#endif // CF
using namespace std;
#define LL long long
#define pb push_back
#define X first
#define Y second
#define cl(a,b) memset(a,b,sizeof(a))
typedef pair<long long ,long long > P;
const int maxn=1005;
const LL inf=1LL<<45;
const LL mod=1e9+7;
int n,k;
int a[maxn];
LL num(){
LL ans=0;
//reverse(a,a+n);
for(int i=0;i<n;i++){
ans=ans*k+a[i];
}
return ans;
}
int main(){

scanf("%d%d",&n,&k);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
LL aa=num();
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
LL bb=num();
if(aa==bb){
printf("=\n");
}
else if(aa>bb){
puts(">");
}
else {
puts("<");
}
return 0;
}