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.

Input: Consider Input: 2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']

Output: 23672


Input: Consider Input: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']

Output: 7267


Input: Consider Input: 9, 17, ['s', 'S', 'i', '3491', 'r', '7025', 'O', 'C', 'K', 'A', '4795', 'L', 'i', '2717', '5553', 'E', '2961', '1241', 'F', 'P', '1877', 'g', '9461', '5845', 'X', 'W']


Output: 16026