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]: 1, 3, ['e', '1703', 'x', 'U', '873']
[A]: 1703


[Q]: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']
[A]: 7896


[Q]: 19, 20, ['r', '8803', '1085', 'z', 'r', 'h', '9693', 'I', '7119', '4863', '1619', 'b', '2565', '351', 'n', 'a', 'O', '617', '1295', 'Y', 'L', 'N', '6017']
[A]:
1295