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.
17, 20, ['49', '1053', '5347', '5457', 'u', 'o', '9357', '9863', '955', 'q', 'v', 'o', '5431', '5967', '3471', 'g', '2089', '1335', 'y', 'N', 'A', '1763', 'A', 'n', 'o', 'm', '4351', 'v', '2335']