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]: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
[A]: 19497


[Q]: 1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']
[A]: 33437


[Q]: 7, 9, ['9519', '3193', 'F', 'P', '2295', 'V', 'v', '2563', 'g', 'e', '9247', 'i', 'x', '8503']
[A]:
2563