{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 wu_ye_zhou 的文章《Sicily.1020. Big Integer》','https://www.xiaopingtou.net/article-58716.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
/*1020. Big Integer
求大整数的模
*/
#include
#include
#include
using namespace std;
//从第一位开始对aa[i]求模，然后往后移一位，给原来的模*10后加上该位，再对aa[i]求模，依次类推
int main()
{
int T;
int aa[100];
cin >> T;
for(int i=1; i<=T; i++)
{
int n;
cin >> n;
for(int k=0; k> aa[k];
string x;
cin >> x;
cout << "(" ;
for(int k=0; k