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.
[[-196, 86, -150, 40, -92, -29, -110], [-152, -191, 68], [-92, -120, 17, -60, -85], [84, 65, -161, -40], [-97, -76, -76, -94, -115, -73, 59], [96, -172, 41, 2, -181, -173, -179], [-188, -15], [-51, -154, 96, 39, -60, 53, 96]]