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.
[[-44, -86, -61, 42], [-57, -156, -95, 55, -34, -89], [-60, 0, 81, -187, -172, -91], [-1, 1, -141, -60, -86], [-16, -40, -126, 38], [-50, -172, -75, -110], [-101, 18, 7, -6, -11, -81]]