Leetcode 3095. Shortest Subarray With OR at Least K I

Find the length of the shortest non-empty contiguous subarray whose bitwise OR of all elements is at least k, or return -1 if no such subarray exists. Input size is small (n ≤ 50, nums[i] and k < 64).