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.

2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
36626

10, 13, ['W', '5479', 'v', '2193', '8465', '3805', 'e', '7721', '983', 'i', '7843', '6803', '9901', 'K', '375', '165', 'M', 'P', 'a', 'J']
24547

12, 16, ['2241', '7161', '6163', '5177', '5143', 'Y', '9001', '6349', '3197', 'L', 'y', 'D', '5967', '7579', '5901', '4553', 'G', 'F']

24000