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.
[[60, -106, -167, -4, 86, 37, -43], [0, 2, -26, -131, -172], [-106, 0, -110, -30, 45], [-193, -193, -187, 73, -47, -192, -94], [-104, -54, -119, 14, 76, -156]]