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, 16, ['8999', '5097', '1081', '2443', '3271', 'l', '3181', '2461', '3059', '3739', 'S', '3761', 'v', '8897', 'G', '4041', '4711', 'v', 'D']