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.

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

Example Input: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
Example Output: 0

Example Input: 1, 1, ['4977', '5087']
Example Output:
4977