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.
[[-67, -34, 6], [-120, 15, 97, -185, -30, -109], [-28, 63, 60, -107, -130, 77, -157], [31, -15, 0, -13], [-43, 90, -132, 18, -18, -60, 51], [62, -87, -31, -118, -105, 63], [-138, -151, -160, 49], [-123, -96]]