Problem:
 Score : 100 points    Problem Statement Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.      Constraints  S and T are strings consisting of lowercase English letters.  The lengths of S and T are between 1 and 100 (inclusive).         Input Input is given from Standard Input in the following format:  S  T       Output Print the resulting string.        Sample Input 1 oder atc      Sample Output 1 atcoder  When S =  oder and T =  atc , concatenating T and S in this order results in atcoder .       Sample Input 2 humu humu      Sample Output 2 humuhumu

Solution (Python):


"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



def solve():
    s,t = invr()
    print(t + s)
        


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("b3.in","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(str,input().split()))
 

def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1],1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

Solution (Python):
s,t=input().split()
print(t,s,sep="")

Solution (Python):


s, t = map(str, input().split())

print(t, s, sep='')

Solution (Python):
S, T = map(str,input().split())
print(''.join(map(str,T+S)))

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S, T = map(str, input().split())
ans = T + S
print(ans)

Solution (Python):
S, T = (str(x) for x in input().split())
print(T+S)

Solution (Python):
print(''.join(reversed(input().split())))

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
a, b = input().split()
print(b+a)

Solution (Python):
s, t = map(str,input().split())
print(t+s)

Solution (Python):
t, s = input().split()

ans = s + t
print(ans)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
S,T = map(str,input().split())
print(T+S)

Solution (Python):
s,t = map(str, input().split())
print(t+s)

Solution (Python):
s, t = input("").split(" ")
res = t + s
print(res)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S, T = input().split(' ')
print(T + S)

Solution (Python):
n,m=input().split()
print(m+n)

Solution (Python):
S , T = map(str, input().split())
print(T + S)

Solution (Python):
a,b=[i for i in input().split()]
print(b+a)

Solution (Python):
a, b = map(str, input().split())
print(b + a)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
a,b = map(str, input().split())

print(b+a)

Solution (Python):
a = input().split()
b = str(a[0])
c = str(a[1])

print(c+b)

Solution (Python):
s, t, = map(str, input().split())

print("{}{}".format(t, s))

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
a, b=map(str, input().split())
print(b+a)

Solution (Python):
def main():
    s,t = map(str, input().split(' '))
    print(t + s)
main()

Solution (Python):
S, T=input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
s, t = map(str, input().split())

print("%s%s"%(t,s))

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):

import sys


def solve(S: str, T: str):
    print(T+S)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)

if __name__ == '__main__':
    main()

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
S,T = input().split()

print(T+S)

Solution (Python):
Ss, Ts = input().split()

print(Ts+Ss)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):


s, t= input().split(' ')
print(t + s)

Solution (Python):
a1=input()
a2=[i for i in a1.split()]
S,T=[a2[i] for i in (0,1)]
print(T+S)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
a,b=input().split()
print(b,a, sep='')

Solution (Python):
S,T = map(str, input().split())
print(T+S)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
x = [x for x in input().split()]
print(x[1]+x[0])

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
S,T = input().split()

print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):

"""
A - Strings
https://atcoder.jp/contests/abc149/tasks/abc149_a

"""
import sys


def main(args):
    S, T = input().split()
    print(T + S)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):


S, T = map(str,input().split())
print(T+S)

Solution (Python):
S, T = input().split(" ")
print(T+S)

Solution (Python):


S, T = input().split(" ")
print(T+S)

Solution (Python):
A, W = list(map(str, input().split()))
output = W + A
print(output)

Solution (Python):
def main():
    S,T = input().split()
    print(T+S)
main()

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
S, T = input().split()
u    = str(T) + str(S)
print(u)

Solution (Python):
def solve():
    s, t = input().split()
    print(t+s)

if __name__ == '__main__':
    solve()

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
s,t= map(str,input().split())
print(t+s)

Solution (Python):
S,T = str(input()).split(' ')
print(T+S)

Solution (Python):
s, t = map(str, input().split())
print(t+s)

Solution (Python):
str_list = list(input().split(' '))
print(str_list[1]+str_list[0])

Solution (Python):
S, T = input().split()

print(T+S)

Solution (Python):
x=list(input().split())
print(x[1]+x[0])

Solution (Python):
S,T = [i for i in input().split()]
print(T+S)

Solution (Python):
s,t=list(map(str,input().split()))
print(t+s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S,T=input().split()
print(T,S,sep="")

Solution (Python):
n,m=input().split()
print(m+n)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s, t = map(str, input().split())
 
x = t + s
print(x)

Solution (Python):

S,T=map(str,input().split())
print(T+S)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    s,t = input().split()

    print(t+s)


if __name__ == '__main__':
    main()

Solution (Python):
s, t = map(str, input().split())
print('{}{}'.format(t, s))

Solution (Python):
li=input().split()
print(li[1]+li[0])

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S, T = input().split()

print(T + S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
a, b = input().split()
print(b+a)

Solution (Python):
a , b = input().split()
print(b + a)

Solution (Python):
s = input().split()
print(s[1]+s[0])

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
s,t = input().split()

print(t+s)

Solution (Python):
S,T =input().split()
ans=T+S
print(ans)

Solution (Python):
S, T = map(str, input().split())
print(''.join(T+S))

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = input().split()

print(T+S)

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    s, t = input().split()
    print(t+s)

if __name__ == '__main__':
    main()

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
print((lambda x: x[1]+x[0])(input().split()))

Solution (Python):
S,T = map(str,input().split())
print(T+S)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t,end="")
print(s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=map(str,input().split());print(t+s)

Solution (Python):
a,b= input().split()
c = b + a
print(c)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t=input().split()
print(t,s,sep="")

Solution (Python):
S,T = input().split()
print(T + S)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
S, T = input().split()

print(T + S)

Solution (Python):
s, t = map(str, input().split())
ans = t + s
print(ans)

Solution (Python):
from sys import stdin

s, t = stdin.readline().rstrip().split()

print(t + s)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
def main():
    s, t = map(str, input().split())
    print(t+s)
    
if __name__ == "__main__":
    main()

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t = map(str,input().split())
print("".join(t+s))

Solution (Python):
a,b=input().split()
print(b+a)

Solution (Python):
s, t = map(str, input().split())
print(t+s)

Solution (Python):
S,T=map(str,input().split())

print(T+S)

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    S, T = input().split()
    print(T + S)


if __name__ == '__main__':
    solve()

Solution (Python):
s, t = input().split()


print('{}{}'.format(t, s))

Solution (Python):
def main():
    S, T = input().split()

    re = T + S
    print(re)


if __name__ == "__main__":
    main()

Solution (Python):
s,t = input().split()
r = t + s
print(r)

Solution (Python):
S, T = input().split()

print(T+S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
A, B = input().split()

print(B+A)

Solution (Python):
S, T = input().split()

print('{}{}'.format(T,S))

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t = map(str, input().split())

print(t + s)

Solution (Python):
s,t = map(str, input().split())

print(t+s)

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    s, t = input().split()
    print(t, end="")
    print(s)
    
    
    
main()

Solution (Python):
s, t= map(str, input().split())
print(t + s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
a, b = map(str, input().split())
print(b+a)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
def main():
  num = list(map(str,input().split()))
  print(num[1]+num[0])

main()

Solution (Python):
def func(S, T):
    ans = T + S
    return ans


if __name__ == "__main__":
    S, T = input().split()
    print(func(S, T))

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    s, t = geta()

    print(t + s)


if __name__ == "__main__":
    main()

Solution (Python):
print(''.join(input().split()[::-1]))

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):

s, t = map(str, input().split())
print(t+s)

Solution (Python):
S,T = input().split()
print(T,S, sep='')

Solution (Python):
s, t =input().split()

print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S,T = input().split()

print(T+S)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
s,t = input().split()

print(t+s)

Solution (Python):
a,b = input().split()
print(b+a)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t = map(str,input().split())

print(t+s)

Solution (Python):

import sys


def solve(S: str, T: str):
    print(T + S)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)

if __name__ == '__main__':
    main()

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S, T = map(str,input().split())

print(T+S)

Solution (Python):
S,T = input().split(" ")

print(T+S)

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    S, T = input().split()
    print(T + S)


if __name__ == '__main__':
    main()

Solution (Python):
S, T = input().split()

ans = T + S

print(ans)

Solution (Python):
s, t = map(str, input().split())

print(t+s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
S, T = map(str, input().split())

print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S, T = map(str, input().split())

print(T + S)

Solution (Python):
a,b = input().split()
print(b + a)

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S ,T = input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s , t = input().split()

print(t+s)

Solution (Python):
s,t = map(str,input().split())
print(t+s)

Solution (Python):
x = input().split()
print(x[1]+x[0])

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
c=input().split(" ")
print(c[1]+c[0])

Solution (Python):
S, T = map(str, input().split())
print(T + S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
x, y = input().split()
print(y+x)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S,T=map(str,input().split())

print(T+S)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()

print(t+s)

Solution (Python):
S,T=map(str,input().split())

print(T+S)

Solution (Python):
s,t=input().split()
x=t+s
print(x)

Solution (Python):
b,a = raw_input().split(' ')
print a + b

Solution (Python):
S,T=map(str,input().split())
print(T+S)

Solution (Python):
a, b = input().split()
print(b + a)

Solution (Python):
st= input().split()
s=st[0]
t=st[1]
print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t = map(str,input().split())
print(t,s,sep="")

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
a, b = input().split()

print(b, end = "")
print(a)

Solution (Python):
import re
def main():
    S , T =map(str, input().split()) 
    print (T+S)

if __name__ == '__main__':
    main()

Solution (Python):

s, t = input().split()
print(t, s, sep="")

Solution (Python):
s,t = input().split()

print(t+s)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
s, t = input().split()

ans = t + s
print(ans)

Solution (Python):
s,t = input().split()
print(t, end = s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
def main():
    S, T = input().split()
    print(T + S)


if __name__ == "__main__":
    main()

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):


import sys
sys.setrecursionlimit(300000)


def solve(S: str, T: str):
    ret = T + S
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)

if __name__ == '__main__':
    main()

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
ST = list(map(str, input().split()))
 
print(ST[1]+ST[0])

Solution (Python):
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

S=ns().split()
print(S[1]+S[0])

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=map(str,input().split());print(t+s)

Solution (Python):
s, t = input().split()

print(t + s)

Solution (Python):
s,t=input().split();print(t+s)

Solution (Python):
s,t=input().split();print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t + s)

Solution (Python):
import sys
def ISS(): return sys.stdin.readline().rstrip().split()

s,t =ISS()
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
ST = list(map(str, input().split()))
word = ST[::-1]

print("".join(word))

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
a,b=map(str,input().split())
print(b+a)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t=input().split()

print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
S,T = input().split()

print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s,t = input().split()

print("".join([t,s]))

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S, T = map(str, input().split())
print('{}{}'.format(T, S))

Solution (Python):
S, T = map(str, input().split())

print(T+S)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S, T = map(str,input().split())
print(T+S)

Solution (Python):
s,t=input().split()
print(t,s,sep="")

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S,T=list(map(str,input().split()))
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S, T = list(map(str, input().split()))
print(T+S)

Solution (Python):

S, T = input().split()

print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s = input().split()
print(''.join(s[::-1]))

Solution (Python):
a,b = input().split()
print(b,a,sep='')

Solution (Python):
print("".join(input().split()[::-1]))

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
a,b=input().split()
print(b+a)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s, t = map(str, input().decode().split())
    print(t, s, sep='')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):

s,t = list(map(str, input().split()))

print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
S, T = input().split(' ')
print(T+S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
a,b=input().split()
print(b,a,sep="")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline

    s, t = input().split()
    print(t+s)


if __name__ == "__main__":
    main()

Solution (Python):

S, T = map(str, input().split())
print(T + S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
import sys
import math
import bisect


def main():
    s, t = input().split()
    print(t + s)

if __name__ == "__main__":
    main()

Solution (Python):
S ,T = input().split()
print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s,t = map(str,input().split())

ts = [t,s]

print("".join(ts))

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):
S, T = input().split(' ')
print(T + S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()

print(t+s)

Solution (Python):
s,t = (i for i in input().split())
print(t+s)

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
s = input().split()

a = s[1] + s[0]

a.join('')
print(a)

Solution (Python):
import fileinput

s, t = input().split()

print(t + s)

Solution (Python):
s,t=map(str,input().split())
l=t+s
print(l)

Solution (Python):
def ABC_149_A():
    S,T = map(str, input().split())
    print(T+S)

if __name__ == '__main__':

    ABC_149_A()

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):

"""
Created on Sat May  9 14:31:38 2020

@author: shinba
"""

s,t = map(str,input().split())

print(t+s)

Solution (Python):
s,t=map(str,input().split())

print(t+s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s = [x.strip() for x in input().split()]
print(s[1] + s[0])

Solution (Python):
S,T = input().split()
a = T + S

print(a)

Solution (Python):
s,t=map(str,input().split())

print(t+s)

Solution (Python):
S, T = map(str, input().split())
print('%s%s' % (T,S))

Solution (Python):
s,t = input().split()
print(t + s ,sep ="")

Solution (Python):
a,b=map(str, input().split())
print(b,a,sep="")

Solution (Python):
S, T = map(str, input().split())
ans = T + S

print(ans)

Solution (Python):
a,b=input().split()
print(b+a)

Solution (Python):
S,T = input().split()
print(T,S, sep="")

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

s, t = Ss()
print(t+s)

Solution (Python):
a,b = input().split()
print(b+a)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
S, T = map(str, input().split())
print(T + S)

Solution (Python):


S, T = map(str, input().split())
print(T + S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s, t = input().split()
print(t, s, sep="")

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):


s, t = list(map(str, input().split()))

print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S,T = input().split()

print(T+S)

Solution (Python):
s,t = map(str, input().split())
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S, T = [_ for _ in input().split()]
print(T+S)

Solution (Python):

def main():
    s, t = input().split(' ')
    print(t, end='')
    print(s)

if __name__ == '__main__':
    main()

Solution (Python):
print(''.join(list(input().split()[::-1])))

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
s,t = input().split()

print(t + s)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
S, T = input().split()

print(T + S)

Solution (Python):
S,T = map(str,input().split())
print(T+S)

Solution (Python):
s,t = map(str,input().split())
print(t+s)

Solution (Python):
s, t = input().split()
print(t, s, sep='')

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
s,t=input().split()
u=t+s
print(u)

Solution (Python):
s , t = map(str, input().strip().split())
print(t+s)

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):
if __name__ == "__main__":
    s, t = input().split()
    print(t+s)

Solution (Python):
S,T=map(str,input().split())
print(T+S)

Solution (Python):
s,t = input().split()
print("{}{}".format(t,s))

Solution (Python):
X, Y = input().split()
print(Y+X)

Solution (Python):
import itertools

def solve():
    s, t = input().split()
    return t+s

print(solve())

Solution (Python):
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False

def is_palindrome(s):
  n=len(s);b=True
  for i in range(int(0.5*n)):
    if s[i]!=s[n-i-1]:b=False
  return b

def main():
  s,t=input().split()
  print(t+s)

if __name__ == '__main__':
    main()

Solution (Python):
print("".join(list(reversed(list(map(str,input().split()))))))

Solution (Python):

def main():
    S, T = input().split()
    print(T + S)


if __name__ == "__main__":
    main()

Solution (Python):
s,t = map(str,input().split())
print(t+s)

Solution (Python):
S,T=input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
s,t = input().split()

print(t,s,sep="")

Solution (Python):
a,b = input().split()

print(b+a)

Solution (Python):


s,t = input().split()
print(t+s)

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
a,b=map(str,input().split())
print(b,a,sep='')

Solution (Python):
s,t = map(str,input().split())
print(t ,end='')
print(s)

Solution (Python):
S,T =input().split()

print(T+S)

Solution (Python):

s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = map(str, input().split())
print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):
s,t=input().split()
print(t,s,sep="")

Solution (Python):
print(''.join(list(reversed(list(input().split())))))

Solution (Python):
print(''.join(list(reversed(list(input().split())))))

Solution (Python):
s,t = map(str,input().split())
print(t+s)

Solution (Python):
S,T=input().split()

print(T+S)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
s, t = map(str, input().split())
print(t+s)

Solution (Python):
a=input().split()[::-1]
print(*a,sep="")

Solution (Python):
A,B=input().split()
print(B+A)

Solution (Python):
s, t = map(str, input().split())
print(t + s)

Solution (Python):
print(''.join(list(input().split(' '))[::-1]))

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):


def main():
    S, T = map(str, open(0).read().split())
    print(T + S)


main()

Solution (Python):
s,t = input().split()
print(t+s)

Solution (Python):
first, second = map(str, input().split())
print(second + first)

Solution (Python):
s, t = map(str, input().split())
print(t+s)

Solution (Python):
s,t=input().split()
print(t+s)

Solution (Python):
l = input().split()
ans = l[1] + l[0]
print(ans)

Solution (Python):
s, t = input().split()
print(t + s)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
S,T = input().split()
print(T+S)

Solution (Python):
S, T = input().split()
print(T+S)

Solution (Python):


S, T = input().split()

print(T + S)

Solution (Python):
S,T=input().split()
TS=T+S
print(TS)

Solution (Python):
S,T = map(str,input().split())

print(T,S,sep='')

Solution (Python):
a, b = list(input().split())
print(b+a)

Solution (Python):
s, t = input().split()
print(t+s)

Solution (Python):
S,T = map(str,input().split())
print(T+S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
S, T = input().split()
print(T + S)

Solution (Python):
s,t=map(str,input().split())
print(t+s)

Solution (Python):
s, t = map(str,input().split())
ans = t + s

print(ans)