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: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']

Output: 655


Input: Consider Input: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']

Output: 38666


Input: Consider Input: 1, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']


Output: 26206