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.
[[-54, 74, -166, 68, 0, -16], [-20, -159, 81, -180, 47], [-65, 14, 16, -73, -149, 86], [40, -129, -94], [-33, 25, 53, -127, -13, -95], [38, -113, -197, -65, -198, 18, -156], [-22, -24, -191, -120, -62], [-173, -190, 32, -144], [8, -169, -149, -9, -102]]