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.
[[-111, -91, -148], [-199, 54, -82], [-107, 99], [16, -163, -106], [80, -112, -14, -92, 52, -81, -150], [9, 37, -90, -179, 31, 22, 22], [-122, -143, -66, -15, -136]]