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.
[[-121, -5, -69, 70], [-36, -42, -68, 75], [64, -1], [-142, -69, -161, -116, -166], [27, -30, 21, 56, 93, -116, -66], [91, -142, 89, 97, -79], [-44, -140, -9, -81, -2, -170], [0, -28, -130, 90, 3, -159]]