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.
[[63, -79, 12], [88, -189, -45, -52, -184, -20], [80, -188, 33, -31, 87, 23, -179], [-151, -190, 30, -192, 46, -181, -60], [-137, -114, 22, -98], [32, -146, 71, -115, -67, -84, 19], [71, 75, -158, -7, -185, 91, 26], [16, -96]]