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.

4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']
3201

4, 13, ['5653', '9869', '5325', '7307', '5513', '2167', '2393', 'p', 'F', '2011', '5431', '2695', 'v', 'p', '3743', 'j', 'y', '5903', '5135', '467', '8443', 'C', 'i', 'w', 'y']
27517

6, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']

31505