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, 57, -36, -116, -133, -80], [40, -23, -114, -193, -131, -88], [38, -47, -138, 43, 49], [-3, 88, -107, 52], [-103, 58, 100, -173, -137], [-36, 44, -180, 49, -77, 16, -132], [-93, -163, -113, -24], [-92, 63, -31, 58, 99, -90, -76]]