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]: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
[EX A]: 47509

[EX Q]: 1, 2, ['1907', '1489', 'm', '4571', 'a']
[EX A]: 3396

[EX Q]: 6, 20, ['5779', 'T', 'n', '8483', 'Y', '3515', '1451', 'L', 'j', '3233', '5511', '4153', '1551', '8823', 'J', '8555', '9965', 'o', 'C', '447', 'E', 'O', '219', '2651']
[EX A]:
47204