C :

#include<stdio.h>

int prime(int n)
{
	int i;
	for(i=2;i*i<=n;i++)
		if(n%i==0)
			return 0;
		return 1;
}
int main()
{
    int a,b,c,i=0;
    for(a=1;a<=9;a++)
		for(b=2;b<=9;b++)
			for(c=0;c<=7;c++)
				if(a!=b&&a!=c&&b!=c&&b>(a+c)&&!prime(a+b))
				{
					i++;
					if(i==70)
					break;
					else
					{
					if(i%8==0)
						printf("%d%d%d \n",a,b,c);
					else
						printf("%d%d%d ",a,b,c);
					}
				}
					printf("791 \n");
}

Pascal :

var
g,s,b,k:longint;
begin
k:=0;
for b:=1 to 9 do
for s:=0 to 9 do
for g:=0 to 9 do
if (b<>s)and(s<>g)and(g<>b)and(s>(b+g)) and(not ((s+b) in [2,3,5,7,11,13,17,19])) then
begin
inc(k);
if k=9 then
begin
k:=1;
writeln;
end;
write(b,s,g,' ');
end;
readln;readln;
end.