<p>Given an <code>m x n</code> integer matrix <code>heightMap</code> representing the height of each unit cell in a 2D elevation map, return <em>the volume of water it can trap after raining</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/08/trap1-3d.jpg" style="width: 361px; height: 321px;" />
<pre>
<strong>Input:</strong> heightMap = [[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]]
<strong>Output:</strong> 4
<strong>Explanation:</strong> After the rain, water is trapped between the blocks.
We have two small ponds 1 and 3 units trapped.
The total volume of water trapped is 4.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/08/trap2-3d.jpg" style="width: 401px; height: 321px;" />
<pre>
<strong>Input:</strong> heightMap = [[3,3,3,3,3],[3,2,2,2,3],[3,2,1,2,3],[3,2,2,2,3],[3,3,3,3,3]]
<strong>Output:</strong> 10
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == heightMap.length</code></li>
	<li><code>n == heightMap[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 200</code></li>
	<li><code>0 &lt;= heightMap[i][j] &lt;= 2 * 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    int trapRainWater(vector<vector<int>>& H) {
        int n = H.size();
        int m = H[0].size();

        vector<vector<int>> dp(n, vector<int> (m));

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = max(dp[i-1][j], H[i-1][j]);
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }


        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }


        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i-1][j], H[i-1][j]));
                    // cout<<i<<" "<<j<<" "<<dp[i][j]<<" A\n";
                    dp[i][j] = min(dp[i][j], max(dp[i][j-1], H[i][j-1]));
                }
            }
        }

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(i == 0 || j == 0) dp[i][j] = 0;
                else if(i == n-1 || j == m-1) dp[i][j] = 0;
                else{
                    dp[i][j] = min(dp[i][j], max(dp[i+1][j], H[i+1][j]));
                    dp[i][j] = min(dp[i][j], max(dp[i][j+1], H[i][j+1]));
                }
            }
        }


        int ans = 0;
        cout<<"A\n";

        cout<<n<<" "<<m<<" IDLn\n";

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                cout<<dp[i][j]<<" ";
                dp[i][j] = max(dp[i][j] - H[i][j], 0);
                ans = ans + dp[i][j];
            }
            cout<<endl;
        }

        return ans;
    }
};
15756