Floods

You are given a grid having $N$ rows and $M$ columns. Each cell of the grid corresponds to a city and has a certain height $H_{i, j}$. You are also given $Q$ queries, each consisting of a single integer $X$, meaning a flood of height $X$ attacks the grid of cities from the sides of the grid. For each query, you are required to print the number of cities that are **not** submerged when a flood of t