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: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']
Example Output: 18799

Example Input: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']
Example Output: 0

Example Input: 2, 6, ['5057', 'x', '3401', '9251', '939', '8287', 'W', 'G', 'Q', 'X', 'J', '2117', 'J', 'N', '7813']
Example Output:
21878