在python中写出以下问题的解决方案:给你一个m x n矩阵M,初始化所有0和一个操作 ops的数组,其中 ops[i] = [ai, bi]意味着M[x][y]应为所有0 <= x <ai和0 <= y <bi增加1个.在执行所有操作后,计算并返回矩阵中最大整数的数量.
Here's a Python solution for the given problem:

```
def max_count(m: int, n: int, ops: List[List[int]]) -> int:
    """
    :param m: rows of matrix
    :param n: columns of matrix
    :param ops: operations 
    :return: count of maximum integers 
    """
    if not ops:
        return m * n
    a_min = min(op[0] for op in ops)
    b_min = min(op[1] for op in ops)
    return a_min * b_min
```

The function max_count takes as input the number of rows and columns of the matrix and the list of operations. It first checks if the ops list is empty, if so then it returns the product of m and n as all values in the matrix will be 0. Otherwise, it finds the minimum of the first and second element of the ops list separately and returns their product which gives us the count of maximum integers.