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: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']

Output: 7371


Input: Consider Input: 1, 23, ['i', '4557', 'd', 'o', '27', '5029', '5375', '9431', '9789', 'X', '8415', 'u', 'x', 'V', 'R', 'X', 'U', '4849', '3079', '4705', 'h', 'C', 'c', '9149', 'd', 'T', '3379', '6893', 'r']


Output: 55256