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, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']

Output: 5045


Input: Consider Input: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Output: 29965


Input: Consider Input: 10, 14, ['u', 'O', '2425', '4827', '4877', '2457', '1045', '6209', 'x', 'n', '6913', 'D', '5985', '6655', '7233', '9707', '249', '6131', 'k', 'c', 'A', 'r', '5619', '2293', '9219']


Output: 19553