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]: 1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
[EX A]: 9035

[EX Q]: 4, 5, ['t', '9215', 'K', 'Q', 'w']
[EX A]: 0

[EX Q]: 11, 11, ['q', '7207', 'p', '5195', 'V', '9927', 'b', '9019', 'k', 's', '8765', 'e', '6629', '8479']
[EX A]:
8765