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: 3, 4, ['h', 'w', 'L', 'L']

Output: 0


Input: Consider Input: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']

Output: 8337


Input: Consider Input: 2, 25, ['N', 'G', '6171', '7721', 'd', 'b', '631', 'O', 'Q', '3757', '1', 'n', 'p', '7171', '9423', '6005', 'T', '5649', 'e', 'j', 'i', 'r', '3813', 'g', 'u']


Output: 50342