def compute_best_test_losses_case1(data, k, total_queries):
    """
    Given full data from a completed nas algorithm,
    output the test error of the arch with the best val error
    after every multiple of k
    """
    results = []
    for query in range(k, total_queries + k, k):
        best_arch = sorted(data[:query], key=lambda i: i[2])[0]
        test_error = best_arch[3]
        results.append((query, test_error))
    return results