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: 20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']

Output: 12464


Input: Consider Input: 1, 1, ['2821', '3823', '9741', 'k', 'X', '2457']

Output: 2821


Input: Consider Input: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']


Output: 10176