#include <cstdio>
using namespace std;

int main() {
	int t,n,x;
	scanf("%d",&t);
	for (int r=1;r<=t;r++) {
		scanf("%d",&n);
		int m=0,mi=0,mj=0;
		int i=0,f=0;
		for (int j=0;j<n-1;j++) {
			scanf("%d",&x);
			f=f+x;
			if (f<0) {
				f=0;
				i=j+1;
			}
			if (f>m || (f==m && j-i>mj-mi)) {
				m=f;
				mi=i;
				mj=j;
			}
		}
		if (m==0) printf("Route %d has no nice parts\n",r);
		else printf("The nicest part of route %d is between stops %d and %d\n",r,mi+1,mj+2);
	}
	return 0;
}