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]: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
[A]: 20863


[Q]: 1, 2, ['t', '9343', 'g']
[A]: 9343


[Q]: 5, 20, ['u', '3343', 'P', '5473', 'f', 'W', 'u', '4331', 'u', '6929', '3349', 'A', '2883', '1401', '5473', '3341', '2189', '6933', '9935', 'R', '8033', '5307', 'K']
[A]:
46764