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.

Q: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']

A: 12782
****
Q: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

A: 15701
****
Q: 6, 27, ['H', 'P', '5013', 'U', 'l', 't', 'y', '3011', '3151', '9659', 'Z', 'E', 'M', '3295', '6973', '9975', '6723', 't', '2669', '4377', 'R', '2285', '2129', '6265', 'I', '2447', 'l']

A:
62959
****