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.

1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
14094

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

4, 6, ['7209', '6553', 'M', '7431', '1385', 'X', 'E', '1313', '6107', 'E', '8067', '1563', 'V', 'r', '5217', '7987', '441', 'n', '2435', '853', 'Y', 'z', '5067', 'L', '5925']

8816