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:
[[15, -109, -144], [-76, 24, -172]]
answer:
[15, 24]


question:
[[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]
answer:
[72, 36, 32, 2, 44, 89]


question:
[[-95, 61, -69, 88, -97, -69, 14], [1, -188, -163, 20, -188, -64, 14], [-52, -200, -26, 46, 42, -143, -97], [-59, -189], [7, -103, -32], [76, -1, -6, -14, -33]]
answer:

[88, 20, 46, -59, 7, 76]