1547.cpp

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>

using namespace std;

int main()
{
   int n, qt, s, ganhador, x;
   vector<pair<int, int> > dist;
   
   cin >> n;
   
   while (n--) {
       cin >> qt >> s;
       
       dist.clear();
       
       for (int i = 0; i < 0; i++) {
           cin >> x;
           dist.push_back(make_pair(abs(x - s), i));
       }
       
       sort(dist.begin(), dist.end());
       
       cout << dist[0].second << endl;
   }
   
   return 0;
}