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.

[[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]
[38, 80, 94, 31]

[[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]
[97, 23, -2, 61, 62, 68, 12, 15]

[[-59, -7, -56, -59], [-103, -140], [83, 13, -67, -68], [-18, 67, -196, 19, -36, -138, 36], [-6, -14, -156, 29, 29]]

[-7, -103, 83, 67, 29]