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: 1, 4, ['1261', 't', 'h', '3615', '7919', 'k']
Example Output: 4876

Example Input: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']
Example Output: 655

Example Input: 13, 13, ['7421', '629', 'c', 'w', 'J', 'x', '2581', 'T', 'T', 'o', '8613', 'j', 'i', 'C', '2169', 'p', '2215', '6007', 'G', '1985', '9439', 'n', '1979', 'G', 'X', 'y']
Example Output:
0