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.

Example Input: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
Example Output: 10497

Example Input: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']
Example Output: 8604

Example Input: 4, 23, ['4181', 'w', 'l', 'r', 'B', 'v', '4327', 'q', '5077', 'r', 'i', '6951', 'U', 'Q', 'S', 'u', '3767', '6677', '6015', '7017', '5611', 'Z', '365', 't', 'x']
Example Output:
45807