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:
11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']

Ex Output:
16421


Ex Input:
1, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']

Ex Output:
1671


Ex Input:
2, 21, ['r', '3871', 'B', 'w', '8681', '5377', 'e', '6285', '3819', 'b', '1159', '1795', 'm', 'U', 'e', '8763', 'B', 'v', '6831', 'h', '8401', '7561', 'A', '2065', '3049', '9577']

Ex Output:

54982