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, 2, ['M', 'I', 'G', '3747']
Example Output: 0

Example Input: 8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']
Example Output: 72398

Example Input: 18, 19, ['8281', 'B', 'R', 'r', '5829', 'D', '5099', '6219', 'g', 'p', 'P', 'o', 'N', 'f', '3421', '3089', '3943', 'S', 'F', 'y', 'K', 'G', 'Z', '4771', '3967', '8025', '2043', 'B']
Example Output:
0