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]: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
[A]: 1930


[Q]: 8, 30, ['5585', '6253', '4067', '2991', '1809', 'y', '8803', 'e', 'T', '695', 'b', '8257', '6427', 'm', '2647', '2207', '3241', '3379', 'L', 'B', 'X', 'R', 'v', 'P', '3989', 'n', 'U', '6143', 'N', 'Y']
[A]: 36985


[Q]: 6, 18, ['Q', 'F', 'v', '6993', 'Q', '5075', '5271', '6393', 'I', 'T', '3191', 'm', '7371', '7897', '8033', '4487', '3675', '5057', '9775', 'n']
[A]:
56450