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]: 4, 4, ['2107', 'l', '7551', '4907']
[EX A]: 4907

[EX Q]: 3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']
[EX A]: 62091

[EX Q]: 17, 21, ['3849', '8419', '669', 'v', 'K', '2589', '8837', 'L', '2247', '4697', '6703', 'y', '7445', 'E', 'W', '6873', 'l', '8393', 'b', '5919', 'r', 'M']
[EX A]:
14312