Q: 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.
[[51, -63, -131, -155, -184, 24, -158], [-30, 12, 98, 69, 53], [77, -6, 31, -116, 41, -153, -190], [-22, 1, -7, -106, -70, 42, -103], [-129, -31, -180, 34, -16, -144, -195], [-191, -195, 93, 35, 64, -120, 76], [30, -200, -97, 23, 63, -197, -44], [-59, -40, 46, -84, 16], [-106, 97, 0, -89, -13]]
A:
[51, 98, 77, 42, 34, 93, 63, 46, 97]