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, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']

Output: 17607


Input: Consider Input: 9, 13, ['6195', 'k', '6835', 'u', '4049', '3063', 'N', 'q', 'R', 'Y', '8573', 'r', '2037', 'w', 'D', 'Y', '9849', 'T', '2245', '6999']

Output: 10610


Input: Consider Input: 14, 19, ['f', '137', '957', '7711', 'i', 'p', 'C', '8911', 'B', '483', 'j', 'x', 'B', '5511', '679', '2739', 'x', '195', '4519', '4361', '8833', '5339', '2341']


Output: 13643