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: 4, 8, ['V', 'd', 'c', '9255', 'A', '2017', '4525', '4237']

Output: 20034


Input: Consider Input: 1, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']

Output: 4621


Input: Consider Input: 6, 12, ['7271', 'L', '6483', 'Z', 'f', 'Y', 'c', '1257', 'B', '3759', '6815', 'p', 'n', '1521', 'T', 'r']


Output: 11831