3930. Power Update After K-th Largest Insertion II

You are given an integer array nums and an integer p.

You are also given a 2D integer array queries, where each queries[i] = [vali, ki].

For each query:

• Insert vali into nums.
• Let x be the kith largest element in the current nums.
• Update p to px % (109 + 7).

Return an array ans where the ans[i] represents the value of p after processing the ith query.

Example 1:

Example 2:

Constraints:

• 1 <= nums.length <= 2 * 104
• 1 <= nums[i] <= 109
• ​​​​​​​1 <= p <= 109
• 1 <= queries.length <= 2 * 104
• ​​​​​​​1 <= vali <= 109
• 1 <= ki <= n + i + 1​​​​​​​