Minimize OR Remaining
You are given an array nums and an integer k. In one operation, pick two adjacent elements and replace them with their bitwise AND, reducing array length by 1. After exactly k operations, find the minimum possible bitwise OR of the remaining elements.