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.
[[18, -100, -3, 63], [-87, -118, -57, 10], [-90, -184, 76, -180], [-15, -72, 10, 80, -114], [83, -96], [-65, -57, 85, -136, -164, -126, 90], [-44, -187, -158, -151, -126, -62, -16], [96, 66, 36, -46, -140], [34, -156, -18, -142]]