#include <stdio.h>

		enum Boolean { False, True };
		template <class Type> class List;					//鏈表類的前視定義
		template <class Type> class ListIterator;				//鏈表結點類的前視定義

		template <class Type> class ListNode {					//鏈表結點類的類聲明
		friend class List <Type>;							//友元
		friend class ListIterator <Type>;					//友元
		friend class Polynomial;
		friend Polynomial operator + ( const Polynomial & ah, const Polynomial & bh );
		public:
		   ListNode ( const Type value ) : data (value), link (NULL) { }
		   //………
		private:
		   Type data;
		   ListNode<Type> *link;
		};

		template <class Type> class List {					//鏈表類的類聲明
		public:
		   friend class ListIterator<Type>;
		   List ( const Type value) { last =first = new ListNode<Type> (value) ; }	//構造函數
		   int sum ();
		   void Add ( const Type value ) ;
		   //………
		private:
		   ListNode<Type> *first, *last;
		};

		template <class Type> class ListIterator {				//鏈表游標類的類聲明
		public:
		   ListIterator ( const List<Type> & l ) : list (l), current (l.first) { }
		   Boolean NotNull ( );
		   Boolean NextNotNull ( );
		   ListNode<Type>* First ( );
		   ListNode<Type>* Next ( );
		private:
		   const List<Type> & list;						//引用一個已存在的鏈表
		   ListNode<Type> *current;						//指向鏈表中的一個結點
		}

		template <class Type> Boolean ListIterator<Type>::NotNull ( ) {
		//檢查鏈表中當前元素是否非空
		   if ( current != NULL ) return True; 					//鏈表當前結點指針非空
		   else return False;
		}

		template <class Type> Boolean ListIterator<Type>::NextNotNull ( ) {
		//檢查鏈表中下一元素是否非空
		   if ( current != NULL && current->link != NULL ) return True;
		   else return False;
		}

		template <class Type> ListNode<Type>* ListIterator<Type>::First ( ) {
		//返回指向鏈表中表頭結點的指針
		   if ( list.first->link != NULL ) { current = list.first; }
		   else { current = NULL; }
		   return current ;
		}

		template <class Type> ListNode<Type>* ListIterator<Type>::Next ( ) {
		//返回指向鏈表中下一個結點的指針
		   if ( current != NULL && current->link != NULL ) { current = current->link; }
		   else { current = NULL; }
		   return current;
		}

		char compare ( int a, int b ) {
		    if ( a > b ) return '>';
		    else if ( a == b ) return '=';
		    else return '<';
		}

		struct Term {						//用鏈表表示的多項式中, 鏈表結點的定義
		   int coef;							//系數
		   int exp;							//指數
		   void Init ( int c, int e ) { coef = c;  exp = e; }
		};

		class Poly