Program:	POLYMULT
Author:	Dave Gaebler
Febraury 18, 1999

Variables used:A,B,C,H,I,N,X,L1,L2,L3,[A]
This program allows you to multiply together any number of polynomials.  First it asks how 
many, then it asks for the length of the longest one.  Then you are asked for each 
polynomial.  Polynomials should all be entered as lists of coefficients with zeros filling 
in for missing powers.  For example, x^4-3x+1 would be {1,0,0,-3,1}.  After a (usually) 
brief think, the result will be a list which is paused so you can scroll if necessary.  
An example: Suppose you wanted to multiply x^2-3, x+2, and x-1.  Number of polys would be 3
and longest would be 3.  The polys would be {1,0,-3}, {1,2}, and {1,-1}.  The result would 
be {1,1,-5,-3,6}, i.e. x^4+x^3-5x^2-3x+6.

Note: This program uses prgmSUBPOLM, which multiplies together two polynomials.  If you 
want to multiply only two, the program goes to a special label designed for that purpose.  
You will not be asked the length of the longest one in this case.  Adding this special 
label made it about three times as fast when multiplying only two polynomials.

