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, ['2167', '7427', 'i', '7289', 'I', '3935', 'o', '6443', 'T', 'e', 'K', '2979', '2025', '5819']
[A]: 7289


[Q]: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']
[A]: 5085


[Q]: 2, 18, ['O', '2307', 'P', 'p', '9821', '3671', '6961', 'D', '9475', '4621', 'h', '6903', '7689', 'F', 'N', 'm', '8371', 'c', 'J', 'L', '5413', '5041', 'e', '8811']
[A]:
59819