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: 2, 3, ['o', 'p', '4765', 'u', '629', 'p']

Output: 4765


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

Output: 12026


Input: Consider Input: 2, 17, ['3575', '4853', '8009', 'P', '6823', 'y', 'h', '2949', 'x', '5319', '3625', 'p', '4415', 'o', 'u', 'R', '7405', '8837', 'V', '6981', 'n', 'j']


Output: 43398