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.
[[29, -7, -98, 98, 56, 17, -74], [12, -52, 40, -25, -137, 34], [-18, 74, 30, -29, -51, -37, -113], [94, 45, -36, -125, -149, 8, -155], [-136, -154, -197, -47, -69], [-81, -168, 99], [-146, 11, -133, -111], [-65, -107, -164, -98, 67], [-81, -146, 30, 58, 1, -176, -57]]