In a particular field, there are trees in a l single row from left to right. Each tree has a value V You cut trees from left to right and for each tree of value V that you cut, you plant (V+ 1) % M trees on the right most end with values ranging from 0 to ((V+1) % M)-1. Initially, there was only one free with value 2. Find the total number of trees present after cutting K trees. ​