In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
22, 29, ['w', '7129', '5957', '1295', '3663', 'n', 'C', 'F', '5443', 'H', '6375', '2887', 'k', 'e', 'o', 'o', '7823', 't', '8339', 'r', '7853', '3071', 'Y', 'H', 'L', '6143', 'C', 'F', 'e', 'K']