radewoosh play computer game there n level number 1 n Levels divide k region group each region contain positive number consecutive levelsthe game repeat follow process if region beat game end immediately Otherwise system find region nonbeaten level Let x denote region the system create bag token each token represent level token represent level for beat level region x system add ti tokens bag token represent ith level let j denote nonbeaten level region x the system add tj tokens bag Finally system take uniformly random token bag player start level represent token a player spend hour beat level beat past Given n k value t1t2tn task split level region each level belong exactly region region contain nonempty consecutive set level what minimum possible expect number hour require finish game