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, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']
42598

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

6, 7, ['p', 'T', '8149', '2911', '3259', 'K', '6947', '6239', 'i', 'Z', '2043', '7667', '9525', 'A', 'O', '6183', '8585']

6947