There is a square grid with dimensions n by m where each square is denoted by (x, y), representing the x-th row from the top and y-th column from the left in this grid, a seeker move through the grid starts at position (x1, y1) and must find its way to a distant square at position (x2 y2) after K moves where each move involves the seeker being placed in a square that shares either the same row or the same column as its current position. The Seeker must not remain in the same square throughout the moves Can you determine the number of valid sequences of moves the Seeker can make to reach the target position? Please provide the answer modulo 99824435\nconstraints: 2<=n,m<=1e9. 1<=K<=1e6.1<=X1,X2<=N . 1<=Y1,Y2<=M.\nDoes anyone has any approach for this?

There is a square grid with dimensions n by m where each square is denoted by (x, y), representing the x-th row from the top and y-th column from the left in th