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:
[[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]
answer:
[36, -23, 76, 20]


question:
[[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]
answer:
[82, -35, 37, 86, 1, 46, 99]


question:
[[-44, 36, -87], [-156, -37, 60], [11, -144, -45, -13], [30, -94, -197, 6, -130], [1, 16, 81], [83, 80, -170, -37, -35], [23, -38, -100, -125, -81, 43, -18], [60, -153]]
answer:

[36, 60, 11, 30, 81, 83, 43, 60]