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.

[EX Q]: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
[EX A]: 10497

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

[EX Q]: 1, 2, ['5289', '299', 'L', '8635']
[EX A]:
5588