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]: 6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
[A]: 13298


[Q]: 1, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']
[A]: 37543


[Q]: 20, 21, ['N', '5351', '7473', '8057', '969', '5125', 'Y', 'E', 'Y', '881', '8929', '307', 'e', 'H', 'z', '2619', '5747', 'g', 'G', '7503', 'K', '1843', '2893', 'H', 'D']
[A]:
7503