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: 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: 1, 2, ['8235', 's']

Output: 8235


Input: Consider Input: 7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']


Output: 8531