#include<bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
int ChangeX(int n, int x);
int jisuan(int str[]);
void too_array(int n,int num[]);
int main()
{
int t;
scanf("%d",&t);
int num_1[100000];
int num_2[100000];
while(t--){
int n,x,y;
cin>>n>>x>>y;
too_array(ChangeX(n,x),num_1);
too_array(ChangeX(n,y),num_2);
int count_1=jisuan(num_1);
int count_2=jisuan(num_2);
if(count_1>count_2){
printf(">\n");
}
if(count_1<count_2){
printf("<\n");
}
else{
printf("=\n");
}
}
return 0;
}
int ChangeX(int n, int x) //利用递归思想把10进制数转换为x进制
{
int a;
if(n)
{
ChangeX(n/x, x);
a = n%x;
if (a < 10)
{
return a;
}
else
{
return (a+55);
}
}
return 0;
}
int jisuan(int num[]){
int count_=0;
for(int i=0;i<100000;i++){
if(num[i]==1){
count_++;
}
return count_;
}
return 0;
}
void too_arrary(int n,int num[]){
for(int i=0; i<100000; i++){
num[i] = n % 10;
n /= 10;
}
}
然后可以顺带看一下我为什么这么解不对吗