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.
13, 15, ['6429', 'd', '4359', '1815', '5429', '7139', '8761', 'W', '6903', '5957', 'Y', '6101', 'p', '2437', '7247', '5891', 'b', '3273', 'U', 'h', 'a', 'A', 't', 'V']