A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?

Input

The input contains two integers a and b (0 ≤ a, b ≤ 103), separated by a single space.

Output

Output the sum of the given integers.

Examples

Input

5 14


Output

19


Input

381 492


Output

873
import java.math.*;
import java.io.*;
import java.util.*;
public class C409H
{
   public static long[] fact, factInv;
   public static int N,M,K;
   public static long MOD = 1000000007;
   public static void main(String[] args) throws IOException {
      InputReader in = new InputReader(new InputStreamReader(System.in));
      PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
      int[] ar=in.nextIntAr();
      int A=ar[0], B=ar[1];
      out.print(A+B+0+0);
      out.close();
   }
   
   public static void setUpChoose(int t) {
      fact = new long[t+1];
      factInv = new long[t+1];
      fact[0] = 1;
      factInv[0] = 1;
      
      for(int x = 1;x <= t; x++) {
         fact[x] = (x * fact[x-1]) % MOD;
         factInv[x] = pow (fact[x],MOD-2);
      } 
   }
   
   public static long choose(int x,int y) {
      if(y > x) 
         return 0;
      long a = fact[x];
      long b = factInv[y];
      long c = factInv[x-y];
      a = (a * b) % MOD;
      a = (a * c) % MOD;
      return a;
   } 
   
   public static long pow(long a,long b) {
      if(b == 1) 
         return a;
      long c = b / 2;
      long temp = pow(a,c) % MOD;
      temp = (temp * temp) % MOD;
      if(b % 2 == 1) temp = (temp * a) % MOD;
      return temp % MOD;
   }
   
   public static boolean isPrime(long x) {
      for(int y = 2; y <= Math.sqrt(x); y++)
         if(x % y == 0) 
            return false;
      return true;
   }
}

class InputReader {
   private BufferedReader br;
   
   public InputReader(InputStreamReader in) {
      br = new BufferedReader(in);
   }

   public int nextInt() {
      try { 
         return Integer.parseInt(br.readLine()); }
      catch (IOException e) { throw new InputMismatchException(); }
   }

   public int[] nextIntAr() {
      try {
         String[] s = br.readLine().split(" ");
         int[] ret = new int[s.length];
         for(int x = 0; x < s.length; x++)
            ret[x] = Integer.parseInt(s[x]);
         return ret;
      }
      catch (IOException e) { throw new InputMismatchException(); }
   }
   
   public long nextLong() {
      try { 
         return Long.parseLong(br.readLine()); }
      catch (IOException e) { throw new InputMismatchException(); }
   }

   public long[] nextLongAr() {
      try {
         String[] s = br.readLine().split(" ");
         long[] ret = new long[s.length];
         for(int x = 0;x<s.length;x++)
            ret[x] = Long.parseLong(s[x]);
         return ret;
      }
         
      catch (IOException e) { throw new InputMismatchException(); }
   }
   
   public String[] nextStringAr() {
      try { 
         return br.readLine().split(" "); }
      catch (IOException e) { throw new InputMismatchException(); }
   }
   
   public String nextString() {
      try { 
         return br.readLine(); }
      catch (IOException e) { throw new InputMismatchException(); }
   }
}
   
class Pair implements Comparable<Pair> {
   Long a;
   Long b;
   
   public Pair(long ma, long mb) {
      a = ma;
      b = mb;
   }
   
   public int compareTo(Pair o) {
      if(a == o.a) 
         return a.compareTo(o.b);
      return a < o.a ? -1 : 1;
   }
}