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.
[[76, -68, -68], [46, -123, 40, -28, -142, -7], [-151, -180, -152, -97, -199], [75, 98, -100, -101], [-8, 72, -161, -100, -171, -9, -197], [37, 22, -194, -71, 29, -50], [-181, -133, -45, -123, -56, 55, -111], [60, -135, -50, 10, -125]]