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: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
Example Output: 0

Example Input: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']
Example Output: 20400

Example Input: 3, 22, ['1663', '3711', '6879', 'Z', 'H', 'i', '6423', '1697', '4145', 'K', '951', '6293', '9551', '6659', '7419', '3477', '557', '5833', 'M', '9681', '1761', '7257', '813']
Example Output:
78583