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]: 12, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']
[A]: 10910


[Q]: 1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']
[A]: 13884


[Q]: 9, 16, ['I', 'm', '519', 'l', '8577', '8687', '8575', '7401', '8701', 'D', '8343', '7293', '2463', 'Q', 'W', 's', '8527', 'r', 'j', 'y']
[A]:
26800