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, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']
[EX A]: 6345

[EX Q]: 2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']
[EX A]: 9180

[EX Q]: 2, 4, ['9421', '3455', '5395', '7349', '3867', 't', 'V', 'A', 'K', 's', 'v', 'S']
[EX A]:
16199