Instructions: 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.
Input: 4, 20, ['J', 'I', '303', 'U', '6205', '4687', '115', 'a', '1075', '5015', 'o', '169', '5657', '8871', 'O', 'u', '1965', 'H', '4219', '5413', 'h', '7325', '3437', '6167', 'k', '2011', 'v']
Output:
43391