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: 4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Output: 439


Input: Consider Input: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Output: 18160


Input: Consider Input: 2, 7, ['e', 'U', 'n', 'a', '1055', '5705', 'f', '7307', 'j', 'D', '8045', 'C', 'n', '3695', 'I', '371', '7241']


Output: 6760