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, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']
[A]: 18164


[Q]: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
[A]: 695


[Q]: 9, 11, ['1167', 'N', '4755', '9491', 'Z', '2341', '1743', 'D', 'A', '5211', '7211']
[A]:
12422