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]: 1, 2, ['4857', '6373']
[A]: 11230


[Q]: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[A]: 6933


[Q]: 1, 6, ['U', 'l', '8083', 'f', 'J', '7869', 'z']
[A]:
15952