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.
[[-160, -89, 70, -29, 97, -158], [-71, 24, 32, -99, 12, -44], [-171, -191, 64, 8, 33, -196, -15], [-77, -133, 81, -12], [59, -75], [-152, -192, -93, 13, 61], [-75, 55, -137, 5, -151], [-56, -183, -118, -116], [87, 77]]