For the Chef and Bananas I have written the following Python code. I am not figuring any cases where it should fail. Can someone help me with my code or suggest me some test cases where it will fail?

```
def find_eat_speed(hours:int, piles:list)->int:
lo = 1
hi = max(piles)
sum_piles = sum(piles)
while lo<=hi:
mid = (lo+hi)//2
if mid*hours > sum_piles and (mid-1)*hours <= sum_piles:
return mid
elif mid*hours <= sum_piles:
lo = mid+1
elif mid*hours > sum_piles and (mid-1)*hours > sum_piles:
hi = mid-1
return hi
if __name__ == '__main__':
t = int(input())
for i in range(t):
n, h = list(map(int,input().split(' ')))
piles = list(map(int,input().split(' ')))
print(find_eat_speed(h,piles))
```