In the first problem of this round the number of operations is the number of bags and you have to include all the indices of the bags. The order of the indices doesn't matter because every bag gets added with the number of candies of the unaffected bag, in the end filling every bag with equally n(n+1)/2 candies. This is what I understand. There is no need to minimize m operations either, so can anyone tell me why this submission is wrong?

https://codeforces.me/contest/1447/submission/98465795