Definition: 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.
Input: ['3767', '8377', '9039', 'A', 'H', 'n', 'w', 'n', '3545', 'B', 'Z', 'D', 'T', '329', '1555', '1089', '9491', '393', '55', 'K', 'z', 'k', '4653', 'A', 'g', '9261', 'r', '5487', 'd', '8469', 'U', 'h', 'q']

3767, 8377, 9039, 1, 8, 14, 23, 14, 3545, 2, 26, 4, 20, 329, 1555, 1089, 9491, 393, 55, 11, 26, 11, 4653, 1, 7, 9261, 18, 5487, 4, 8469, 21, 8, 17