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: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']

Output: 0


Input: Consider Input: 11, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']

Output: 523


Input: Consider Input: 3, 5, ['w', '2085', '3473', 'h', 'J', 'x', 'M', 'h', 'q', '4331', '7073', '6209', '8073', 'Q', '3915', '8131', 'Q', '8419', 'x', 'b']


Output: 3473