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]: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']
[A]: 10432


[Q]: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']
[A]: 42698


[Q]: 11, 13, ['8649', 'm', '6833', '4891', 't', 'o', '4535', '1551', 'p', 'v', '2349', 'R', '9269', 'N', 'o', 'J', '8873']
[A]:
11618