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, 24, ['2799', 's', '9623', 'R', '9711', '5537', '641', 'e', 'h', 'n', 'e', '7023', '5721', 'K', '5155', '9957', '4513', '393', '5671', '9943', 'm', '4455', 'l', '3843', 'u', 'd', '5031']