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.
[[41, 33, -101], [-145, 76, 7, -101], [68, 36, -200, -98, 85, 25, -64], [-156, 29, 86, -78, -101], [-163, 27, -81, -187, -195], [-190, -158, -89, -12, 78, -67, -170], [25, 46, -164], [28, -162, 46, -151]]