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.
[[-163, 17, -2, -63, -4, -113], [-196, 31, 22, 50, -18, -192], [-140, -89, 81, -136], [-141, -57], [18, 20, 34, -188], [-140, 95], [-132, -180], [58, -18, 39]]