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, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
Example Output: 7479

Example Input: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
Example Output: 33375

Example Input: 5, 8, ['7961', 'z', '8461', '9847', '7787', '3549', '8193', '4725']
Example Output:
24254