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.
[[61, -169, -70, 12, 20, -145], [-68, -109, -73, -147, 31, -68, 60], [-64, 1, -163, 0, -45, -10], [90, -182, -141, -34], [-164, -16], [-7, -66, -195, -148, 96, 23], [-47, 18, 55], [50, 5, -47, -17, -54]]