#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************



vector<int> a;
vector<int> b;

vector<int> consistency(int n, int k) {
    
	//* Assuming a[0] < b[0]
	int i=0, j=n-1;
	
	int maxSum = 0;
	int x = -1, y = -1;
	
	while(i<n && j>=0){
	    int sum = a[i] + b[j];
	    if(sum <= k){
	    	if(sum>maxSum){
	    		maxSum = sum;
	    		x = i;
	    		y = j;
	    	}
	        i++;
	    }
	    else if(sum >= k){
	        j--;
	    }
	}	
	
	return {a[x], b[y], maxSum};
    
}














vector<int> practice(int n, int k) {
	

	
	return {};
}




void solve() {
    
    int n, k;
    cin >> n >> k ;
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    auto ans1 = consistency(n, k);
    
    cout << ans1[0] << "+" << ans1[1] << "=" << ans1[2] << endl;

    // auto p = practice(n, k);
    // cout << "( " << ans1[0] << "+" << ans1[1] << "=" << ans1[2] << " ) -> ";
    // cout << "( " << p[0] << "+" << p[1] << "=" << p[2] << " )"  << endl;
    
    
}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}