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:
3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']

Ex Output:
0


Ex Input:
1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Ex Output:
6095


Ex Input:
2, 3, ['I', '2773', 'A', '4725', 'w', 's', '5817', 'n', '3727', 'o', '4073', '5619', 'S', '6995', '6323', '9777', '4745', '6521', 'H', 'U', '269', '5547', '1921', '3837', '3523', '7043', '9773', 'o']

Ex Output:

2773