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, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']

Output: 4621


Input: Consider Input: 12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']

Output: 22751


Input: Consider Input: 1, 1, ['d', '1779', 's', 'V', '8053']


Output: 0