Given N tasks and K computers and a 2D arrayC of boolean values, where C[i][j] indicates that computer i can process task j, return the maximum concurrent tasks that can be processed.

Input

N = 3
K = 3
C = [[1, 0, 0], [0, 1, 0], [0, 0, 1]]

Output - 3

I stumbled through and was not able to give an optimal solution.