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: 1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']

Output: 0


Input: Consider Input: 1, 3, ['b', '3997', '285', 'T']

Output: 4282


Input: Consider Input: 1, 17, ['q', 'f', 'Y', 'E', 'U', '9319', '171', 'r', '1029', 'G', '113', '9825', '3791', 'd', 'k', '7837', '1627', 'h', 'i', 'W', 'K', 'F']


Output: 33712