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:
14, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']

Ex Output:
5479


Ex Input:
12, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']

Ex Output:
10910


Ex Input:
7, 17, ['A', 'g', 'w', '4403', '4353', '7587', '5571', '9153', 'b', '4565', 'v', '3269', 'p', '9793', 't', 'Z', 'x', '2763', 'T', 'W', 'f', 'f', 'W', 'E', 'q', 'P', '1563']

Ex Output:

32351