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.
--------
Question: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]

Answer: [63, 2, 29, 18, 98]


Question: [[-18, -120, -153, -70, 77, -106, -3], [-196, -40, -105, 2, -151, -114, 4]]

Answer: [77, 4]


Question: [[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]

Answer:
[9, 12, -158, -39, -80, 73, 51, 69, 53]