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.
[[77, -10, -86, -142, 31, -199], [-101, 37], [-171, -52, -50, -135, -63], [-84, -39, -63, -110, -154, -191, -154], [-111, -117, -86, -9], [37, -38, -132], [-1, 81], [-118, -108, -85]]