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, 1, ['1449', '1257']

Output: 1449


Input: Consider Input: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

Output: 5085


Input: Consider Input: 5, 16, ['X', '3013', 'V', 'o', 'V', '6733', '1475', 't', 'Q', 'V', '9587', 'W', 'B', 'p', 'S', 'G', '9799', 'V', 'S', '5075']


Output: 17795