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:
[[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
answer:
[100, 97, 77, 11, 52, 74, 99, -25, 8]


question:
[[7, 42, -200, -138], [-113, -158, -17, -60, -38]]
answer:
[42, -17]


question:
[[39, -136, -158, -163], [-167, -192], [99, -127], [-112, -65, -34, -132, -2], [-96, -141, 89, -148, -115], [21, -140, -138, 89, -13], [-137, -152]]
answer:

[39, -167, 99, -2, 89, 89, -137]