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:
7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']

Ex Output:
8531


Ex Input:
5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']

Ex Output:
31876


Ex Input:
14, 27, ['9143', '731', 'A', 'P', '5417', '2039', '5377', 'd', 'T', 'z', '4373', '1603', 'J', 'D', '711', '3073', 'D', 'm', '1461', '7721', 'A', 'o', 'O', 'S', 'O', '1347', 'z']

Ex Output:

14313