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: 13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']

Output: 17796


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: 1, 1, ['3813', 'Q', 'l', 'T', 'a']


Output: 3813