3806. Maximum Bitwise AND After Increment Operations

You are given an integer array nums and two integers k and m. You may perform at most k operations. In one operation, you may choose any index i and increase nums[i] by 1. Return an integer denoting the maximum possible bitwise AND of any subset of size m after performing up to k operations optimally. Example 1: Input: nums = [3,1,2], k = 8, m = 2 Output: 6 Explanation: - We need a subset