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.
[[-164, 50, -18, 79, -46, -127], [5, 16, 99, 11, 86, -71], [90, -144, 56, -194], [20, -20], [-155, -196, 56, -81], [-149, -89, -132, -197], [-121, 95, -188, -54, -115], [-116, -114, -114]]