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:
[[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]
answer:
[67, 76, 63, 72]


question:
[[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
answer:
[34, 39, 62, 66, 38, -85, -2, -53]


question:
[[89, -83, -196, -29, 40], [86, -49, -34], [-16, -30, -135], [-120, 7, -160, -11, -109], [-12, -59, -71, -196], [-80, -155, -85], [-44, -138, -59, -7, -76, 1, -133], [-90, -111, -174, 46]]
answer:

[89, 86, -16, 7, -12, -80, 1, 46]