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.
13, 22, ['T', 't', 'm', 'n', 'c', '5237', 'R', 'L', '2943', '8453', '2365', '393', 'D', 'S', '581', 'E', '271', 'H', 'y', 'L', '483', '9837', '2813', '4905']