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: ['w', '8999', 'd', 'B', '6995', 'm', '6899', 'U', 'l', 'g', '9803', '7309', 'B', '4889', 'K', '9251', '8393', '4703', '3119', 'M', 'k', 'U', '873', 'b', 'f', '7429', 't', 'z', 'K', 'C', 'n', '7161', 'G']

23, 8999, 4, 2, 6995, 13, 6899, 21, 12, 7, 9803, 7309, 2, 4889, 11, 9251, 8393, 4703, 3119, 13, 11, 21, 873, 2, 6, 7429, 20, 26, 11, 3, 14, 7161, 7