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.
[[-30, 3, -3], [25, 19, -59], [-107, 15, 68, -96, -43], [-197, 60, 57, 29, -134], [83, -125], [85, -80, -45, 3, 61, 5], [-116, -197, 20, -12, -29, 22, -81], [-191, 84, 71, 53]]