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.

11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']
6078

11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']
7973

4, 18, ['7957', 'Y', '4641', '2393', 'i', 'F', '4673', '9807', 'Y', 'X', '9531', 'p', 'J', '1833', 'o', '6657', '1931', 'y', '2113', 'T', '6775', '4843', '3723', 'O', '8345', '9689', 'M', 'g', 'y', '3955']

36825