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.
[[-169, -100, 98, 55, -83], [-191, -163, 76, -104, 67, 62], [-105, 72, -28, -58], [58, 1, -24, -98], [79, -22, -173, -125, -112, -157, -143], [-128, -10, 1, -121, 47, -180, -129], [-106, -11, -164, -79, 25, -118]]