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: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Output: 1351


Input: Consider Input: 14, 24, ['A', '6333', 'I', 'R', 'D', '5267', 'b', 'C', 'n', '7493', '8285', 'l', '201', 'P', 'M', '977', '2263', '4605', 'U', 'm', 'o', 'S', 'x', 'q', 'x']


Output: 7845