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, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']
[EX A]: 16375

[EX Q]: 8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']
[EX A]: 18164

[EX Q]: 1, 3, ['8645', '6071', '4203', 'a', 'L', '7307', '9499']
[EX A]:
18919