Birbal and his Ledger

Once upon a time, Birbal was walking along the road and saw a ledger. While looking at the ledger he finds a unique pattern with numbers. Birbal has N numbers and he finds and there is always a sub-array (continuous subset) of numbers whose sum is divisible by N. To test his hypothesis, he comes up with T (Test Cases) sets of N integers and tries to find smallest sub-array whose sum is divisible b