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: 7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']

Output: 12073


Input: Consider Input: 9, 19, ['Y', '501', 'J', '3991', '9247', 'l', 'a', 'q', '5453', 'O', 'm', '2811', '207', '7301', 'y', '8865', '8153', 'b', 'b', '5157', 'd', '2397', '6877', 'J']


Output: 32790