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, 2, ['M', '3453', '5733', '2337', '9975', '1827', 't', '4937']
[EX A]: 3453

[EX Q]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[EX A]: 4866

[EX Q]: 9, 9, ['D', 'G', '6647', 'g', '8581', '4267', 'y', '9485', 'i', '455', '6907', '7547', '6437', 'L', 'T']
[EX A]:
0