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, ['T', '8713', '4913', 'U', '2467', 'l', '2623', 'S', 'i', 'q', '3505', '879', '1701', 'Y', 'm', 'h', 'W', 'j', 'd', 'H', '1289', '787', 'T', 'I', '9317']