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: 1, 3, ['b', '3997', '285', 'T']

Output: 4282


Input: Consider Input: 3, 4, ['8047', '1063', 'q', '9775', 's', '905', 'h', 'z', 'L', '2277', '7645', 'k', '2069', 'g', 'd', '13', 'd']


Output: 9775