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.

5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']
36237

4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']
13650

7, 10, ['4829', 'F', 'q', 'a', 'm', 'b', '1569', 'z', 'C', 'W', 'K', 'L', '5765']

1569