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:
4, 4, ['2107', 'l', '7551', '4907']

Ex Output:
4907


Ex Input:
3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']

Ex Output:
62091


Ex Input:
16, 27, ['9563', '7845', 'k', '7655', '5605', '9817', 'X', '6935', 'O', '3815', '1785', '1855', 'q', 'h', 'n', '5741', '7155', '9435', 'X', 'a', 'w', '6547', '9067', 'z', '2103', 'I', 'Q', '9073', 'o']

Ex Output:

40048