triplet with sum k (using hash map)

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string,int> psi;
typedef map<int,int> mii;
typedef map<long long,long long> mll;
typedef map<string,int> msi;
typedef map<char,int> mci;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;

#define FOR(i, a, b) for (auto i=a; i<=(b); i++)
#define FORd(i,b,a) for (int i =b; i >= a; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ins insert

const int MOD = 1000000007;
//type functions here
//using map
bool check(mll &m,vi &v,int k)
{
    int size=(v.size()-3);
    FOR(i,0,size)
    {
        ll temp=k-v[i];
        m[v[i]]--;


        FOR(j,i+1,size+1)
        {
         ll temp2=temp-v[j];
         m[v[j]]--;
         if(m[temp2]>0) return true;
        }
        FOR(j,i+1,size+1)
        {

         m[v[j]]++;

        }
    }
    return false;
}

int main() {
     ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tc=1;
    cin>>tc;
    FOR(j,1,tc){
    vi v;//={5, 5 ,1};
    int k,n;
    cin>>n>>k;
    FOR(i,1,n)
    {
        int temp;
        cin>>temp;
        v.pb(temp);
    }
    mll m;
   // ll min=*min_element(v.begin(),v.end());//am i audibl

    for(auto x:v)
    m[x]++;

    bool c=check(m,v,k);
    if(c) cout<<"true"<<endl;
    else cout<<"false"<<endl;

    }
    return 0;
}