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 Input:
23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']

Ex Output:
15772


Ex Input:
1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

Ex Output:
8063


Ex Input:
14, 26, ['U', 'D', '5391', '2975', 'b', 'b', '8741', '8991', '9083', '5401', '481', 'q', 'j', '8757', 'C', '2027', '6683', '5667', 'R', '631', 'm', '3743', '9769', '1039', '923', 'Q', '4373', '7451']

Ex Output:

39239