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]: 3, 4, ['v', 't', '4357', '1303']
[A]: 5660


[Q]: 2, 2, ['E', 'i']
[A]: 0


[Q]: 16, 18, ['3453', 'i', 'x', 'U', '6223', '9603', 'y', '3879', 'P', '849', 'K', 'Q', 'u', '6705', '4009', 'C', 'G', '6927', '2001', '2213', 'f', '9583', 'G']
[A]:
6927