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, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
[A]: 439


[Q]: 2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
[A]: 13630


[Q]: 11, 19, ['c', '7395', '1447', 'd', 'u', '3233', '8445', 'c', '1661', '6299', 'T', '2627', 'p', '8921', 'u', '1563', 'P', 'g', '73', 'A', '7523', 'G', 'd', 'q', 'P']
[A]:
13184