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: 11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']
Example Output: 1325

Example Input: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
Example Output: 16811

Example Input: 5, 11, ['R', '6047', 'a', 'x', '7911', '4545', 'd', '2641', '1979', 'p', '2229', '9143']
Example Output:
19305