SELECT 
    'within 100' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 100

UNION ALL

SELECT 
    'within 150' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 150

UNION ALL

SELECT 
    'within 200' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 200

ORDER BY BUCKET;

def minMoves(h, w, h1, w1):
    if h1 > h or w1 > w:
        return -1
    moves = 0
    while h > h1:
        h = (h + 1) // 2
        moves += 1 
    while w > w1:
        w = (w + 1) // 2
        moves += 1 
    return moves

def maxPosPrefixes(arr):
    arr.sort(reverse=True)
    prefix_sum = 0
    positive_count = 0
    for num in arr:
        prefix_sum += num
        if prefix_sum > 0:
            positive_count += 1
        else:
            break  
    return positive_count

def solution(menu, order):

    t_cost = 0
    for item in order:
        pizza = next(p for p in menu if p.name == item.name)
        price = getattr(pizza, f'price_{item.size[0]}')
        total_cost += price * item.quantity
    total_pizzas = sum(item.quantity for item in order)
    if total_pizzas >= 3:
        cheapest_price = min(getattr(next(p for p in menu if p.name == item.name), f'price_{item.size[0]}')
                             for item in order)
        discounted_cost = t_cost - cheapest_price
        return min(t_cost, discounted_cost)
    return t_cost

def isPrime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def endsWithThree(n):
    return n % 10 == 3

def maxGameScore(cell):
    n = len(cell)
    dp = [float('-inf')] * n
    dp[0] = cell[0]  
    
    for i in range(1, n):
        dp[i] = max(dp[i], dp[i-1] + cell[i])

        for j in range(i):
            jump = i - j
            if isPrime(jump) and endsWithThree(jump):
                dp[i] = max(dp[i], dp[j] + cell[i])
    
    return dp[n-1]