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.
[[-195, -193, 49, 31, 66, -105], [-96, -31, -191, -44], [-88, -151], [-120, -2, -192, -22], [91, -164, 14], [-194, -9, 2, -104, 80, -52, -33], [-55, -92, -15, -62, -149, 82, -151], [-10, -12, 56, -86, 83], [-89, 66, -157, -30]]