Help Wanted

[Ian@wilks.demon.co.uk (Ian M Wilks)]

Help, can you help please?

As an assignment I have to learn enough Ada and write the following parallel 
program:

Find the prime numbers in the first 100 numbers (1, 2, 3, ... , 99, 100) 
using the Sieve of Eratosthenes.  Write down all numbers from 2 to 100.  
The first number in the list (2) is a prime.  Strike off all multiples of 2.  
On the remaining list the next number (3) is a prime.  Strike off all 
multiples of 3, and so on.

Task 1 - Produces numbers from 2 to 100

Task 2 - outputs the first number it gets, deletes multiples of 2 from the
         list and passes the remaining list to Task 3.

Task 3 - outputs the first number it gets, deletes multiples of 3 from the
         list and passes the remaining list to Task 4.

Task n - outputs the first number it gets, deletes all multiples of the first
         number and passes the remaining list to the next task.

Can anyone let me have any code similar to this that I can adapt.  Unfortunately
I'm running out of time!!!

Thanks.