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.
[[-26, 59, -57, 28, 64, -102], [56, -96, -15, -83, 92, -33, -20], [-194, 38, -125, -113], [83, 42, -29, 73], [-181, 70, -13, -200, 81, -133, -197], [5, -165, -97, -146]]