#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <string>

using namespace std;

#define FOR(i,a,b)      for(int (i)=(a);(i)<(b);(i)++)
#define PB              push_back
#define INF             INT_MAX
#define DEBUG(___x)     cout<<#___x<<" = ["<<___x<<"]"<<endl
#define SORT(___a)      sort(___a.begin(),___a.end())
#define RSORT(___a)     sort(___a.rbegin(),___a.rend())
#define PI              3.141592653589793238
#define MP              make_pair
#define PII             pair<int,int>
#define ALL(___v)       (___v).begin(), (___v).end()
#define VS              vector<string>
#define VI              vector<int>
#define S               size()
#define B               begin()
#define E               end()
#define print(___v)     {cout<<"[";if(___v.S)cout<<___v[0];FOR(___i,1,___v.S)cout<<","<<___v[___i];cout<<"]\n";}
#define clr(___x, ___v) memset(___x, ___v , sizeof ___x);

typedef long long                   bint;
typedef map< string,int >           msi;
typedef map< string,int >::iterator msit;
typedef map< VI ,int >              mvi;
typedef map< VI ,int >::iterator    mvit;
template<typename T> string tos( T a )  { stringstream ss; string ret; ss << a; ss >> ret; return ret;}

class <%:class-name%> {
public:
    <%:return-type%> <%:method-name%>(<%:param-type-list%>);
};

<%:return-type%> <%:class-name%>::<%:method-name%>(<%:param-list%>) {
    <%:set-caret%>
}

<%:testing-code%>