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: 1, 6, ['B', 'N', 'b', '9383', '4711', 'K']

Output: 14094


Input: Consider Input: 8, 24, ['2767', '5843', '2707', '2337', '6373', '1267', 'T', 'l', 'N', 'T', 'Z', 'Y', '699', '8411', 'L', '3983', '9083', '4929', '3757', 'R', '2281', '3547', '9079', 'R', '787']

Output: 45769


Input: Consider Input: 2, 16, ['3167', '9851', 'c', '8065', '8033', '2069', '6789', 'j', 'P', '8537', '4273', 'Q', '7291', '3721', '3287', 'g', '85', 'd', '9283', '1677', 'S']


Output: 61916