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: 11, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']

Output: 19478


Input: Consider Input: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']

Output: 34908


Input: Consider Input: 1, 2, ['K', 'F']


Output: 0