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:
[[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
answer:
[61, 28, 95, 9]


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:
[[-10, 29, 36, 48], [-170, -100, -30, 86, -30], [-127, 12, -72, 8], [1, -181, -165, -159, -162, -153, 97], [13, -180], [33, -30, -61, -144]]
answer:

[48, 86, 12, 97, 13, 33]