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.
[[-150, -146, -123, 39, 76, -99, 13], [-58, 95, -13], [-108, -171, -144, 86, -148], [-153, -158, 59, -106, 36, 64, -183], [-107, -106, -104, -58, -77, -19, -94], [-157, -13], [-49, -97, 70], [24, -126, -199, -146], [-61, -58, -54, 56, -22, -141]]