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.

Input: Consider Input: 10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']

Output: 1739


Input: Consider Input: 4, 17, ['n', 'U', 'b', '6139', '4187', '757', '2059', '5677', 'O', 'n', '73', 'F', '2573', 'K', 'I', '8921', '1483', 'C', '319', '7525', 'X', '3031', 'A', '6693', 'q', '549', 'N']

Output: 31869


Input: Consider Input: 9, 11, ['7649', 'B', '7229', 'S', '5749', '435', '9799', 'I', 'U', '2713', 'P', '1217', 'G', '7645', '8097', '7583']


Output: 2713