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: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']

A: 0
****
Q: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']

A: 23119
****
Q: 9, 28, ['6713', '6067', '3455', 'k', '3849', '3199', 'M', 'J', '1111', 'A', '2107', '6103', 'E', '6273', '6725', 'a', 'g', 'p', '3313', '6107', '9965', '9695', '303', 'y', '8945', '2641', 'V', '2389', '1519']

A:
65677
****