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, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']

Output: 36328


Input: Consider Input: 1, 2, ['t', '9343', 'g']

Output: 9343


Input: Consider Input: 11, 21, ['9705', '9397', '9991', 'j', 'Z', 't', 'X', '343', 't', '5747', 'm', 'h', '6137', '533', '7409', '9989', 'l', 'K', '495', '4559', 'f', '3307', '475', 'S', '6431', '4607', 'f']


Output: 29122