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.
--------
Question: 6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']

Answer: 3811


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

Answer: 695


Question: 4, 7, ['7625', '683', '1861', '8001', 'F', '1433', 'q', 'c', 'A', 'z', '2699', '6531', 'N', 'M', '7221', 'c', 'w', 'O', '5925', 'J', 'Z', '4757', 'A', '7143', '3565', 'x', 'Q']

Answer:
9434