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, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
[EX A]: 22725

[EX Q]: 1, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']
[EX A]: 23384

[EX Q]: 3, 8, ['2775', 'z', '8209', 'c', 'm', 'W', '6441', '1683', 'm', '6933', 'B', '4853', '7179', '2971', 'F', '2173', 'F', '6349', '9505', 'J', 'y', '4207', '981']
[EX A]:
16333