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.
3, 22, ['S', '9057', 'v', '3073', 'k', 'z', '6937', 'w', 'C', 'l', 'O', 'H', 'd', 'p', 'l', 'y', 'n', '6935', '3457', 'I', 'R', 'I', 'm', 'V', 'v', '2163', '1387', 'h', '2617']