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, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']
Example Output: 31505

Example Input: 3, 4, ['1809', '1127', 'm', '3137']
Example Output: 3137

Example Input: 14, 25, ['7621', '6717', 'p', '9441', '2789', '5149', '6837', 'Q', '4891', '4753', '671', '6219', '7757', '7271', '3091', 'x', '4705', '8019', 'x', 'W', 'Y', '8139', '3773', 'P', 'w']
Example Output:
34998