Maximum number of augmenting paths in a network flow
I got it myself... The idea is to set the flows of all edges to 0 one by one. It will take  M iterations to do so. Once all edges are set to zero it becomes clear that the highest number of augmenting paths can not exceed the number of edges that are 0.And since there are M such edges the maximum number of possible paths is M as well.