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.
8, 13, ['1371', 'z', 'Y', 'F', 'F', 'A', '6281', 'Z', 'Y', '145', '5265', '9561', '1433', '2049', 'v', 'P', 'G', 'n', '3555', 'L', 'g', '4833', '6899', 'P', 'T', '1013', '5395', 'z']