/*

verdict : wrong answer
October challenge
Problem : Chef and Ground

*/
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
	int T;
	cin >> T;
	int n, m, num;
	vector <int> v;
	while (T--)
	{
		v.clear();
		cin >> n >> m;
		for (int i = 0; i < n; i++)
		{
			cin >> num;
			v.push_back(num);
		}
		sort(v.begin(), v.end());
		int biggest_num = v[n - 1];
		int total_diff = 0;
		for(int i = 0; i < n; i++)
		{
			total_diff += biggest_num - v[i];
		}
		int flag = 0;
		if(m < total_diff)
		{
			cout << "NO" << endl;
			flag = 1;
			//cout << 1 << endl;
		}
		else if (total_diff == m)
		{
			cout << "YES" << endl;
			flag = 1;
			//cout << 2 << endl;
		}
		else
		{
			while (total_diff <= m)
			{
				total_diff += n;
				//cout << total_diff << endl;
				if (total_diff ==  m)
				{
					cout << "YES" << endl;
					//cout << 3 << endl;
					flag = 1;
					break;
				}
			}

		}
		if (flag == 0)
		{
			cout << "NO" << endl;
			//cout << 4 << endl;
		}

	}
	return 0;
}