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.
10, 13, ['159', '2011', 'j', '3379', 'k', 'r', 'J', '6773', '9213', 'u', '7509', '4319', 'b', '1587', '3853', 'K', '3281', 'I', 'm', '7047', '897', 'X', '9417', 'X', '9057', 'z', 'S', '3027', '3039', 'G']