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, 20, ['6775', '3993', 'i', 'V', 'l', 'p', 'g', 'C', 'A', 'Y', '4229', '6483', 'S', 'k', 'G', '8475', '7333', '8831', 'Y', '9715', 'X', '2617', 'l', '6995', '8493']