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, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']
[A]: 19369


[Q]: 2, 2, ['E', 'i']
[A]: 0


[Q]: 3, 8, ['N', '5513', '9003', '2301', '4307', '9047', 'P', '9111', 'k', '6505']
[A]:
33769