/*
  	ID: #
	Copyright: mintzy###
	Author: Nguyen Ngoc Minh
	Date: 7/22/2017 5:14:11 PM
	Description:
*/
 
#include <bits/stdc++.h>
 
using namespace std;
const int MN = 100;
char s[MN] ;
void Swap(char &a,char &b) {
	char t;
	t = a;
	a = b;
	b = t;
}
bool nextPermutation(char * s) {
	int len = strlen(s);
	int k = len - 2;
	while(k >= 0 && s[k] >= s[k + 1] ) k--;
	if(k < 0) return false;
	int t = len - 1;
	while(s[t] < s[k] ) t--;
	Swap(s[t],s[k]);
	int l,r;
	l = k + 1;
	r = len - 1;
	while(l < r) {
		Swap(s[l] , s[r]);
		l++;
		r--;
	}
	return true;
}
int main(){
	// Your code goes here
	int test,stt;
	cin >> test;
	while(test--) {
		cin >> stt >> s;
		cout << stt << " ";
		if(nextPermutation(s)) cout << s << endl;
		else cout << "BIGGEST\n";
	}
	return 0;
}
 

LyoKICAJSUQ6ICMKCUNvcHlyaWdodDogbWludHp5IyMjCglBdXRob3I6IE5ndXllbiBOZ29jIE1pbmgKCURhdGU6IDcvMjIvMjAxNyA1OjE0OjExIFBNCglEZXNjcmlwdGlvbjoKKi8KCiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKY29uc3QgaW50IE1OID0gMTAwOwpjaGFyIHNbTU5dIDsKdm9pZCBTd2FwKGNoYXIgJmEsY2hhciAmYikgewoJY2hhciB0OwoJdCA9IGE7CglhID0gYjsKCWIgPSB0Owp9CmJvb2wgbmV4dFBlcm11dGF0aW9uKGNoYXIgKiBzKSB7CglpbnQgbGVuID0gc3RybGVuKHMpOwoJaW50IGsgPSBsZW4gLSAyOwoJd2hpbGUoayA+PSAwICYmIHNba10gPj0gc1trICsgMV0gKSBrLS07CglpZihrIDwgMCkgcmV0dXJuIGZhbHNlOwoJaW50IHQgPSBsZW4gLSAxOwoJd2hpbGUoc1t0XSA8IHNba10gKSB0LS07CglTd2FwKHNbdF0sc1trXSk7CglpbnQgbCxyOwoJbCA9IGsgKyAxOwoJciA9IGxlbiAtIDE7Cgl3aGlsZShsIDwgcikgewoJCVN3YXAoc1tsXSAsIHNbcl0pOwoJCWwrKzsKCQlyLS07Cgl9CglyZXR1cm4gdHJ1ZTsKfQppbnQgbWFpbigpewoJLy8gWW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IHRlc3Qsc3R0OwoJY2luID4+IHRlc3Q7Cgl3aGlsZSh0ZXN0LS0pIHsKCQljaW4gPj4gc3R0ID4+IHM7CgkJY291dCA8PCBzdHQgPDwgIiAiOwoJCWlmKG5leHRQZXJtdXRhdGlvbihzKSkgY291dCA8PCBzIDw8IGVuZGw7CgkJZWxzZSBjb3V0IDw8ICJCSUdHRVNUXG4iOwoJfQoJcmV0dXJuIDA7Cn0K

NQoxIDIzNAoyIDMyNAozIDMzMzMzCjQgOTg4MjY1NDIKNSAxMjM0NQ==

5
1 234
2 324
3 33333
4 98826542
5 12345