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, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']

Output: 1671


Input: Consider Input: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']

Output: 20863


Input: Consider Input: 1, 13, ['9255', '1193', 'v', '5609', 'H', '6419', '2917', '5481', '2319', '1677', 'X', '8397', '3327', '1673', 'A', 'O', 'w', 'Y', '305', '2127', '4003']


Output: 46594