Definition: 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: 5, 27, ['8993', 'R', 'K', '2469', 'm', '6779', '8921', 'x', 'd', 'T', '3569', '7211', '8837', '9623', '6135', 'I', '4319', 'R', 'n', '9049', '8177', 'c', '9679', 's', '9419', '2911', '8835', '7091', '5953']

103464