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, 3, ['x', '971', '3029']
[EX A]: 4000

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

[EX Q]: 1, 10, ['8455', '617', '8567', '3243', '6759', '6781', 'I', '3485', 'E', '2829', 'W', 'n', 'B', '8897', '5777', 'W', 's', 'm', 'N', '6297', '3063']
[EX A]:
40736