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: 1, 1, ['5141', 'S']
Example Output: 5141

Example Input: 3, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']
Example Output: 45112

Example Input: 8, 17, ['r', '8647', '8695', '3335', '811', 'A', '8501', '6865', 'h', 'G', '9897', 'p', '8727', 'p', 'Z', 'k', 'w', '8883', 'p', '8779', '2311', '3851', 'J', 'z', 'B', 'z', '5599', 'w']
Example Output:
25489