A list comprehension is a special syntax in some programming languages to describe lists. It is similar to the way mathematicians describe sets, with a set comprehension, hence the name.

Some attributes of a list comprehension are:

 They should be distinct from (nested) for loops and the use of map and filter functions within the syntax of the language.
 They should return either a list or an iterator (something that returns successive members of a collection, in order).
 The syntax has parts corresponding to that of set-builder notation. 


Task

Write a list comprehension that builds the list of all Pythagorean triples with elements between   1   and   n.

If the language has multiple ways for expressing such a construct (for example, direct list comprehensions and generators), write one example for each.




global function new_dict(integer pool_only=0)
global procedure destroy_dict(integer tid, integer justclear=0)
global procedure setd(object key, object data, integer tid=1)
global function getd(object key, integer tid=1)
global procedure destroy_dict(integer tid, integer justclear=0)
global function getd_index(object key, integer tid=1)
global function getd_by_index(integer node, integer tid=1)
global procedure deld(object key, integer tid=1)
global procedure traverse_dict(integer rid, object user_data=0, integer tid=1)
global function dict_size(integer tid=1)
