instruction:
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:
[[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]
answer:
[55, 21, 75, 84]


question:
[[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]
answer:
[59, 61, 74]


question:
[[-75, -2], [-187, -33, 48, 51, 45], [-116, -177, -58, -93, -14, -195, -2]]
answer:

[-2, 51, -2]