Poor Chef

A school runs for $N$ days and each day consists of classes of $M$ different subjects. Fees for the courses change each day ie $A(i, j)$ is the fee for jth subject on ith day. Chef is poor and wants to attend one class each day such that he does not have to attend the same subject for consecutive days and the total cost is minimum. Find the minimum possible total fees chef will pay if he atte