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.

Input: Consider Input: 4, 5, ['677', '5585', 'W', 'J', 'C']

Output: 0


Input: Consider Input: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

Output: 6175


Input: Consider Input: 7, 13, ['U', 'Q', '1481', '6511', '6587', '1121', 'U', '2485', 'e', '9115', 'L', 'L', '8003', 'g', '9183', '5093', 'z', '6749', 'u', '6369', 't', 'u', '7323', 'F', 'C', '7819', '817']


Output: 19603