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.
15, 25, ['l', '1131', 'x', 'F', 'h', '7969', '4179', 'L', 'V', '5221', 'f', 'C', '5993', 'u', '9115', '8645', '1201', 'R', 'J', 'J', '3175', 'V', 'f', 'l', '7495', '665', '9373', '2743', 'D', '9285']