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: 3, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']
Example Output: 37505

Example Input: 9, 13, ['6195', 'k', '6835', 'u', '4049', '3063', 'N', 'q', 'R', 'Y', '8573', 'r', '2037', 'w', 'D', 'Y', '9849', 'T', '2245', '6999']
Example Output: 10610

Example Input: 1, 9, ['8547', 'J', 'R', 'J', 'S', 'S', '1841', 'Z', '9289', '7733', '6001', 't', '6387', '9271', '3645', 'I', '3355', '2215', 'd', 'T', '6315', '6695', 'Q', '97', 'U', '453', 'e']
Example Output:
19677