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.
[[26, 0, -164, -132, 74], [-182, -126, 37, 45, -52, 92, -101], [-100, -174, -54, 92, -192, -136, 57], [-166, -96, 49], [-152, 3], [-26, 69, -52, -114, -183, 26, 30], [96, -61, -175, -184, 74, 16, 9], [80, -71, -199, 60, -158, -159], [-193, -113, -78, -81]]