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.
[[-65, 75, -108, -133, 7, 69, -80], [-127, -131, 81, -105, -91, -22], [-64, 44, -134, -126, 30, -194, -159], [28, -49, -193], [22, -4], [-143, -167], [-150, 40, 78, 79, -34], [-55, -105, -167, -58, -168, -100, -18], [-41, -6, 26]]