You are given N arrays each containing N positive integers. In one move, we perform the following operations for each array: Write a new Array B of size N-1 where b=a;xa-1, for all 1sisN-1. Then replace array A with array B. It is given that before doing any move you can reorder the elements of the array in any way you want. However, you can't reorder the elements during the move. You must keep applying the above move until A has only one element. In other words, its size is equal to 1. Additionally, you need to ensure that the final array A consisting of only one element must be the maximum possible value. Let us call this maximum possible value X. Your task is to find the value of the sum of X for each of the given arrays. Since the answer can be very large you are asked to print it modulo 10^9+7. You are given N arrays each containing N positive integers. In one move, we perform the following operations for each array: Write a new Array B of size N-1 where b=a;xa-1, for all 1sisN-1. Then replace array A with array B. It is given that before doing any move you can reorder the elements of the array in any way you want. However, you can't reorder the elements during the move. You must keep applying the above move until A has only one element. In other words, its size is equal to 1. Additionally, you need to ensure that the final array A consisting of only one element must be the maximum possible value. Let us call this maximum possible value X. Your task is to find the value of the sum of X for each of the given arrays. Since the answer can be very large you are asked to print it modulo 10^9+7