Given the task definition, example input & output, solve the new input case.
In this task, you are given an input list A. You need to convert all the alphabets in the list with a number representing their position in the English alphabet. E.g., replace A by 1, B by 2, a by 1, b by 2, and so on.
Example: ['8129', 'a', '4245', '2391', 'Y', '7569']
Output: 8129, 1, 4245, 2391, 25, 7569
Here, the alphabets in the list are 'a' and 'Y', hence we replace them by their positions in the English alphabet '1' and '25', respectively in the input list to get '8129, 1, 4245, 2391, 25, 7569'.

New input case for you: ['587', '1657', 'C', '509', '41', '3609', 's', '9825', '625', 'Z', '1215', 'P', 'v', 'm', '7199', '1727', 'j', '4699', 'z', 'Q', 'y', 'f', '8837', '7505', 'y', '9777', '5063', '6393', '5591', '8495', '8797', '6101', 'h', '6083', '4209', '6765']
Output:
587, 1657, 3, 509, 41, 3609, 19, 9825, 625, 26, 1215, 16, 22, 13, 7199, 1727, 10, 4699, 26, 17, 25, 6, 8837, 7505, 25, 9777, 5063, 6393, 5591, 8495, 8797, 6101, 8, 6083, 4209, 6765