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: 10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']
Example Output: 7947

Example Input: 1, 3, ['E', '6187', '5861', '3697', '2749', '1171', '6085', 'c', '2291', '2385', '7335', 'B']
Example Output: 12048

Example Input: 11, 21, ['8435', '2523', '8549', 'j', 'n', '8141', 'W', 'g', 'n', '9235', 'a', 'k', '3335', 'f', 'd', '5701', 'x', '8767', '891', 'W', '8271', 'z', 'W', '2517']
Example Output:
26965