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: 5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Output: 4571


Input: Consider Input: 1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']

Output: 12026


Input: Consider Input: 20, 22, ['4207', '7627', '4519', '2793', '5975', 'u', '9097', 'a', '1977', '7653', '5517', 'D', 'X', 'd', '8947', '2931', 'X', 'E', '3409', '8391', '533', '7057', '6413', '2751', '8773', '6949', '2169']


Output: 15981