void bucket_sortINTS(int tab[], int b, int m)
{
	int ind;
	vector<vector<int>> temp(b);
	//cout << b << endl;
	for (int i = 0; i < b; i++)
	{
		ind = floor((tab[i]) / (double(m)*b));
		//cout << ind << " ";
		temp[ind].push_back(tab[i]);
	}
	cout << endl;
	for (int i = 0; i < b; i++)
	{
		sort(temp[i].begin(), temp[i].end());
	}
	int w = 0;
	for (int i = 0; i < b; i++)
	{
		for (int j = 0; j < temp[i].size(); j++)
		{
			tab[w++] = temp[i][j];
		}
	}
	for (int i = 0; i < b; i++)
	{
		cout << tab[i] << " ";
	}
}