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, 5, ['t', '9215', 'K', 'Q', 'w']

Output: 0


Input: Consider Input: 9, 21, ['h', 'C', '8411', 'j', '5693', 'L', 'D', 'V', 't', 't', 'E', '3101', '5045', '9945', 'P', 'q', 'e', 'k', 'T', 'b', 'A', '7015', '6635', '3769', 'j', 'X', '6469']

Output: 18091


Input: Consider Input: 6, 15, ['5027', 'g', 'r', '9743', 'S', '8073', 'A', '7623', '69', '8901', '6837', 'T', '6115', 'i', '2615', '2497']


Output: 40233