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.
22, 24, ['c', 'n', 'q', 'k', '7603', 'J', '7113', 'A', 's', 'y', '407', 'N', 'z', 'x', '8157', 'l', 'A', '1165', '7003', 'G', '7629', 'L', 'J', 'V', 'z', '6585']