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.

[Q]: 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']
[A]: 13650


[Q]: 1, 2, ['4319', '3495']
[A]: 7814


[Q]: 9, 13, ['r', '9421', '7197', '1535', 'z', '2205', 'H', 'K', 'd', 't', 'U', '1453', '3965', '9331', '149', '2311', '5975']
[A]:
5418