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.
1, 2, ['f', 's', '8403', '6677', '8893', 'T', '8561', '4973', '7861', 'x', 'w', 'C', '5815', '8509', 'b', '417', 'l', 'p', '491', 'T', 's', '1057', '829', 'V', 'X', '439', 'k', 'B', 'H']