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.
[[30, 26, -16, -67, -40, 10], [-197, -102, 33], [41, -60, -18, -116, -39, 16], [76, 18, -148, -186, -91], [-105, -160, -22, -174, 19, -187, 8]]