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, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
[EX A]: 5085

[EX Q]: 3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']
[EX A]: 0

[EX Q]: 2, 14, ['U', 'I', 'B', 'y', 'Q', '3863', 'H', '1767', '4725', '8653', '7729', '8429', 'M', 'j', '8849', '6785', '3061']
[EX A]:
35166