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: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']

Output: 18799


Input: Consider Input: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Output: 10432


Input: Consider Input: 4, 12, ['Y', 'D', 'x', '9497', '717', 'a', '5939', '6561', 'n', '5133', '8289', '9485', '9605', '5017']


Output: 45621