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]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[EX A]: 4866

[EX Q]: 2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
[EX A]: 13630

[EX Q]: 8, 13, ['m', '6845', '2887', 'c', '1589', 'D', 'b', '8697', '3455', 'r', 'C', 'v', '8045', '7847', '4937', '9559']
[EX A]:
20197