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.
[[39, -136, -158, -163], [-167, -192], [99, -127], [-112, -65, -34, -132, -2], [-96, -141, 89, -148, -115], [21, -140, -138, 89, -13], [-137, -152]]