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, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
Example Output: 283

Example Input: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']
Example Output: 10387

Example Input: 15, 18, ['3117', '8749', '3579', '4463', 'W', '4627', '5413', 'E', '6227', '3955', 'P', 'r', 'h', 'w', 'j', '5555', '4731', 'm', 'U', 'y', '5361', '8593', 'n', '1103', '8575', '1829', '8971', '1437']
Example Output:
10286