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.

[Q]: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']
[A]: 10176


[Q]: 1, 2, ['8895', 't', '5739']
[A]: 8895


[Q]: 2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
[A]:
20324