in pesudocode please and thank you

Find a Greedy algorithm for the following problem: Given n arrays of size m each. Find the maximum sum obtained by selecting a number from each array such that the elements selected from the i-th array are more than the element selected from (i-1)-th array. If maximum sum cannot be obtained, then return 0 . Example: A[n][m]={{1,7,3,4},{4,2,5,1},{9,5,1,8}} where n=3 and m=4 Output : 18=4+5+9