#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
#define LL long long
#define ull unsigned long long
using namespace std;
const int N=1e5+5;
const int INF=0x3f3f3f3f;
int a[N],f[N];
int main(){
	int t;
	cin >> t;
	while(t--){
		int mt=0;
		int n,m;
		cin >> n >> m;
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		int sum=0,num=0,numb=0;
		for(int i=1;i<=n;i++){
			scanf("%d",&f[i]);
			sum=max(sum,f[i]);
		}
		if(sum==0){
			printf(">-<\n");
			continue;
		}
		bool flag=0;
		int my=0;
		for(int i=1;i<=n;i++){
			if(f[i]==1&&num==0){
				num=a[i];
				break;
			}
		}
		for(int i=1;i<=n;i++){
			if(f[i]==1&&a[i]==num){
				my++;
			}
			if(f[i]==1&&a[i]!=num){
				flag=1;
			}
			if(a[i]==num){
				numb++;
			}
		}
		if(flag||my!=numb){
			printf("^v^\n");
		}else if(my==numb){
			cout << num << endl;
		}
	}
	return 0;
}