Binary Search in 3D Array

A team has to perform binary search on a three-dimensional sorted integer array. Instead on working directly at the content level, the team decided to start with the dimensions. Let $A$ be an $X \times Y \times Z$ array of integers and the value to be searched is $num$. The process starts by applying binary search only on the first dimension. Once the index, say $midx$, for the first dimension