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.
[[11, -173, 52], [-79, -5, 64, 27], [83, -31, 7, -200, -121], [96, -170, 55], [49, -113, -160, -28, -30], [-38, 52, 49, 60, -102, -16], [-182, -127, -41], [-108, -79, -75, 23, -63, 43]]