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, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']

Output: 11382


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: 16, 18, ['8301', '8775', '9709', '7771', 'c', '3355', 'l', '3441', 'q', '8209', '2377', '6831', '7683', 'h', 'u', 'u', '7155', '8309', '9963', '6059', 'N', '7373', '5165', '2221']


Output: 15464