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]: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
[EX A]: 0

[EX Q]: 12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']
[EX A]: 8625

[EX Q]: 1, 3, ['7607', 'v', 'd']
[EX A]:
7607