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]: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
[EX A]: 3932

[EX Q]: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']
[EX A]: 22632

[EX Q]: 2, 2, ['1123', '595', 'B']
[EX A]:
595