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, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']

Output: 23672


Input: Consider Input: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']

Output: 1937


Input: Consider Input: 5, 6, ['2219', 'J', 'J', '1483', 'p', 'L']


Output: 0