In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[68, 54, -143, -64], [-110, -125, -46, -63, 65, -136, 67], [-119, -162], [-28, -159], [-160, 49, -180, 85, -199, -162], [27, -116, -82, -161, 92], [36, -66], [-80, -142, -109, -9, -158]]