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.

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

[EX Q]: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']
[EX A]: 10235

[EX Q]: 7, 14, ['n', '9797', '865', '6087', 'f', '9259', '1997', 'R', 'i', 'C', '8897', 'U', '7827', 'n', '4451', '1703', 'U', '2015', '3935']
[EX A]:
18721