import java.util.*;
import java.io.*;
class Main
{
	static boolean visited[];
	static long dp[][][];
	static long MOD=1000000007L;
	static Hashtable<String , Long>hash=new Hashtable<>();
	public static void main(String args[]) throws java.lang.Exception
	{
		BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
			// String h[]=inp.readLine().split(" ");
			// String h[]=inp.readLine().split(" ");

			String h[]=inp.readLine().split(" ");
			System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1]));
			
	}
	static int[] gg(String aa)
	{
		int a[]=new int[aa.length()];
		for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		}
		return a;
	}
	static long get(int a[], int d, int sum, int tight, int i)
	{
		if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;}
		// if(dp[i][sum][tight]!=-1){return dp[i][sum][tight];}
		String s=i+" "+sum+" "+tight;
		if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);}
		long ans=0;
		
		int limit=(tight==0?9:a[i]);
			for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			}
			// dp[i][sum%d][tight]=ans;
			hash.put(s,ans);
			return ans;	
	}


	
	static long bfs(int src, ArrayList<ArrayList<Integer>>arr)
	{
		Queue<Pair>q=new LinkedList<>();
		q.add(new Pair(src,1,1));
		visited[src]=true;
		long ans=0;
		while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		}
		return ans%MOD;
	}
}
class Pair
{
	int a;
	long b;
	long c;
	Pair(int e, long f, long h)
	{
		a=e;
		b=f;
		c=h;
	}
} import java.util.*; util.* java import java.io.*; io.* java class Main
{
	static boolean visited[];
	static long dp[][][];
	static long MOD=1000000007L;
	static Hashtable<String , Long>hash=new Hashtable<>();
	public static void main(String args[]) throws java.lang.Exception
	{
		BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
			// String h[]=inp.readLine().split(" ");
			// String h[]=inp.readLine().split(" ");

			String h[]=inp.readLine().split(" ");
			System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1]));
			
	}
	static int[] gg(String aa)
	{
		int a[]=new int[aa.length()];
		for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		}
		return a;
	}
	static long get(int a[], int d, int sum, int tight, int i)
	{
		if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;}
		// if(dp[i][sum][tight]!=-1){return dp[i][sum][tight];}
		String s=i+" "+sum+" "+tight;
		if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);}
		long ans=0;
		
		int limit=(tight==0?9:a[i]);
			for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			}
			// dp[i][sum%d][tight]=ans;
			hash.put(s,ans);
			return ans;	
	}


	
	static long bfs(int src, ArrayList<ArrayList<Integer>>arr)
	{
		Queue<Pair>q=new LinkedList<>();
		q.add(new Pair(src,1,1));
		visited[src]=true;
		long ans=0;
		while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		}
		return ans%MOD;
	}
} Main static boolean visited[]; visited static long dp[][][]; dp static long MOD=1000000007L; MOD 1000000007L static Hashtable<String , Long>hash=new Hashtable<>(); hash new Hashtable<>() public static void main(String args[]) throws java.lang.Exception
	{
		BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
			// String h[]=inp.readLine().split(" ");
			// String h[]=inp.readLine().split(" ");

			String h[]=inp.readLine().split(" ");
			System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1]));
			
	} main {
		BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
			// String h[]=inp.readLine().split(" ");
			// String h[]=inp.readLine().split(" ");

			String h[]=inp.readLine().split(" ");
			System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1]));
			
	} BufferedReader inp = new BufferedReader (new InputStreamReader(System.in)); inp new BufferedReader (new InputStreamReader(System.in)) String h[]=inp.readLine().split(" "); h inp.readLine().split(" ") inp.readLine().split inp.readLine() inp.readLine inp " " System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1])) System.out.println System.out System System.out Integer.parseInt(h[0])*Integer.parseInt(h[1]) Integer.parseInt(h[0]) Integer.parseInt Integer h[0] h 0 Integer.parseInt(h[1]) Integer.parseInt Integer h[1] h 1 String args[] args static int[] gg(String aa)
	{
		int a[]=new int[aa.length()];
		for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		}
		return a;
	} gg {
		int a[]=new int[aa.length()];
		for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		}
		return a;
	} int a[]=new int[aa.length()]; a new int[aa.length()] aa.length() aa.length aa for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		} int i=0; int i=0; i 0 i<aa.length() i aa.length() aa.length aa i++ i++ i {
			a[i]=(int)aa.charAt(i)-(int)'0';
		} {
			a[i]=(int)aa.charAt(i)-(int)'0';
		} a[i]=(int)aa.charAt(i)-(int)'0' a[i] a i (int)aa.charAt(i)-(int)'0' (int)aa.charAt(i) aa.charAt aa i (int)'0' return a; a String aa aa static long get(int a[], int d, int sum, int tight, int i)
	{
		if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;}
		// if(dp[i][sum][tight]!=-1){return dp[i][sum][tight];}
		String s=i+" "+sum+" "+tight;
		if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);}
		long ans=0;
		
		int limit=(tight==0?9:a[i]);
			for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			}
			// dp[i][sum%d][tight]=ans;
			hash.put(s,ans);
			return ans;	
	} get {
		if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;}
		// if(dp[i][sum][tight]!=-1){return dp[i][sum][tight];}
		String s=i+" "+sum+" "+tight;
		if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);}
		long ans=0;
		
		int limit=(tight==0?9:a[i]);
			for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			}
			// dp[i][sum%d][tight]=ans;
			hash.put(s,ans);
			return ans;	
	} if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;} i==a.length i a.length a a.length {if(sum%d==0 && sum!=0){return 1;}return 0;} if(sum%d==0 && sum!=0){return 1;} sum%d==0 && sum!=0 sum%d==0 sum%d sum d 0 sum!=0 sum 0 {return 1;} return 1; 1 return 0; 0 String s=i+" "+sum+" "+tight; s i+" "+sum+" "+tight " " sum i+" "+sum+" "+tight i " " sum " " tight if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);} hash.containsKey(i+" "+sum+" "+tight) && tight!=1 hash.containsKey(i+" "+sum+" "+tight) hash.containsKey hash i+" "+sum+" "+tight " " sum i+" "+sum+" "+tight i " " sum " " tight tight!=1 tight 1 {return hash.get(i+" "+sum+" "+tight);} return hash.get(i+" "+sum+" "+tight); hash.get(i+" "+sum+" "+tight) hash.get hash i+" "+sum+" "+tight " " sum i+" "+sum+" "+tight i " " sum " " tight long ans=0; ans 0 int limit=(tight==0?9:a[i]); limit (tight==0?9:a[i]) tight==0 tight 0 9 a[i] a i for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			} int j=0; int j=0; j 0 j<=limit j limit j++ j++ j {
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			} {
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			} int newt=(a[i]==j?tight:0); newt (a[i]==j?tight:0) a[i]==j a[i] a i j tight 0 ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD ans (ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD (ans%MOD+get(a,d,sum+j,newt,i+1)%MOD) ans%MOD ans MOD get(a,d,sum+j,newt,i+1)%MOD get(a,d,sum+j,newt,i+1) get a d sum+j sum j newt i+1 i 1 MOD MOD hash.put(s,ans) hash.put hash s ans return ans; ans int a[] a int d d int sum sum int tight tight int i i static long bfs(int src, ArrayList<ArrayList<Integer>>arr)
	{
		Queue<Pair>q=new LinkedList<>();
		q.add(new Pair(src,1,1));
		visited[src]=true;
		long ans=0;
		while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		}
		return ans%MOD;
	} bfs {
		Queue<Pair>q=new LinkedList<>();
		q.add(new Pair(src,1,1));
		visited[src]=true;
		long ans=0;
		while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		}
		return ans%MOD;
	} Queue<Pair>q=new LinkedList<>(); q new LinkedList<>() q.add(new Pair(src,1,1)) q.add q new Pair(src,1,1) visited[src]=true visited[src] visited src true long ans=0; ans 0 while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		} q.size()!=0 q.size() q.size q 0 {
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		} ans=0 ans 0 int size=q.size(); size q.size() q.size q for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			} int j=0; int j=0; j 0 j<size j size j++ j++ j {
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			} {
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			} Pair t=q.poll(); t q.poll() q.poll q ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD ans (ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD (ans%MOD+(t.b%MOD+t.c%MOD)%MOD) ans%MOD ans MOD (t.b%MOD+t.c%MOD)%MOD (t.b%MOD+t.c%MOD) t.b%MOD t.b t t.b MOD t.c%MOD t.c t t.c MOD MOD MOD for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				} Integer node arr.get(t.a) arr.get arr t.a t t.a {
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				} {
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				} if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					} !visited[node] visited[node] visited node {
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					} visited[node]=true visited[node] visited node true q.add(new Pair(node,t.b+t.c,t.b)) q.add q new Pair(node,t.b+t.c,t.b) return ans%MOD; ans%MOD ans MOD int src src ArrayList<ArrayList<Integer>>arr arr class Pair
{
	int a;
	long b;
	long c;
	Pair(int e, long f, long h)
	{
		a=e;
		b=f;
		c=h;
	}
} Pair int a; a long b; b long c; c Pair(int e, long f, long h)
	{
		a=e;
		b=f;
		c=h;
	} Pair {
		a=e;
		b=f;
		c=h;
	} a=e a e b=f b f c=h c h int e e long f f long h h
import java.util.*;
import java.io.*;
class Main
{
	static boolean visited[];
	static long dp[][][];
	static long MOD=1000000007L;
	static Hashtable<String , Long>hash=new Hashtable<>();
	public static void main(String args[]) throws java.lang.Exception
	{
		BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
			// String h[]=inp.readLine().split(" ");
			// String h[]=inp.readLine().split(" ");

			String h[]=inp.readLine().split(" ");
			System.out.println(Integer.parseInt(h[0])*Integer.parseInt(h[1]));
			
	}
	static int[] gg(String aa)
	{
		int a[]=new int[aa.length()];
		for(int i=0;i<aa.length();i++)
		{
			a[i]=(int)aa.charAt(i)-(int)'0';
		}
		return a;
	}
	static long get(int a[], int d, int sum, int tight, int i)
	{
		if(i==a.length){if(sum%d==0 && sum!=0){return 1;}return 0;}
		// if(dp[i][sum][tight]!=-1){return dp[i][sum][tight];}
		String s=i+" "+sum+" "+tight;
		if(hash.containsKey(i+" "+sum+" "+tight) && tight!=1){return hash.get(i+" "+sum+" "+tight);}
		long ans=0;
		
		int limit=(tight==0?9:a[i]);
			for(int j=0;j<=limit;j++)
			{
				int newt=(a[i]==j?tight:0);

				ans=(ans%MOD+get(a,d,sum+j,newt,i+1)%MOD)%MOD;
			}
			// dp[i][sum%d][tight]=ans;
			hash.put(s,ans);
			return ans;	
	}


	
	static long bfs(int src, ArrayList<ArrayList<Integer>>arr)
	{
		Queue<Pair>q=new LinkedList<>();
		q.add(new Pair(src,1,1));
		visited[src]=true;
		long ans=0;
		while(q.size()!=0)
		{
			ans=0;
			int size=q.size();
			for(int j=0;j<size;j++)
			{
				Pair t=q.poll();
				ans=(ans%MOD+(t.b%MOD+t.c%MOD)%MOD)%MOD;
				for(Integer node:arr.get(t.a))
				{
					if(!visited[node])
					{
						visited[node]=true;
						q.add(new Pair(node,t.b+t.c,t.b));
					}
				}
			}
		}
		return ans%MOD;
	}
}
class Pair
{
	int a;
	long b;
	long c;
	Pair(int e, long f, long h)
	{
		a=e;
		b=f;
		c=h;
	}
}