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.
[[-113, 28, -105, -11, -116, -100, 23], [74, -196, -157, -193, 77], [60, -163, -31, -84, 78], [69, -119], [87, -73, -44, -148, -39, 53], [75, -96, -146, -39, -125, -159, -34], [-172, -187, -51, -39, -69, -129], [97, -133, 97], [8, 43, 4, 49, -144, 12]]