Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given a 1-indexed m x n integer matrix mat, you can select any cell in the matrix as your starting cell.
From the starting cell, you can move to any other cell in the same row or column, but only if the value of the destination cell is strictly greater than the value of the current cell. You can repeat this process as many times as possible, moving from cell to cell until you can no longer make any moves.
Your task is to find the maximum number of cells that you can visit in the matrix by starting from some cell.
Return an integer denoting the maximum number of cells that can be visited.
 
Please complete the following python code precisely:
```python
class Solution:
    def maxIncreasingCells(self, mat: List[List[int]]) -> int:
```