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.
[[28, -85, 76, -117, 50, -49, -22], [-27, -96, 52, -2, -168, -56], [-141, 81], [32, 35, -34, -100, 3, -116], [-30, -139, 97, 41, -159, 17, 5], [-95, 6, -173, 23, -16], [92, 12, 20, -11, -57]]