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):
s, t = input().split()
print("{}{}".format(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):
S ,T = input().split()
print(T+S)

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

Solution (Python):
s, t = input().split()
print(''.join([t, s]))

Solution (Python):


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

print(T+S)

Solution (Python):
a = list(map(str, input().split()))
print("{}{}".format(a[1], a[0]))

Solution (Python):
import sys
input = sys.stdin.readline().rstrip
li = input().split()
S = li[0]
T = li[1]
print(T+S)

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 





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

print (T+S)

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 = input().split()
print(T+S)

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
s,t=input().split()
print(t+s)

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

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

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

print('{}{}'.format(a[1],a[0]))

Solution (Python):
Ar = list(map(str,input().split()))
S=Ar[0]
T=Ar[1]

print(T+S)

Solution (Python):
Ar = list(map(str,input().split()))
S=Ar[0]
T=Ar[1]

print(T+S)

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

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

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

string = T + S

print(string)

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

print(T + S)

Solution (Python):


s, t = input().split()


print(t+s)

Solution (Python):
s = input().split()
print(s[1], end='')
print(s[0])

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

Solution (Python):

import sys

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

s = input[0]
t = input[1]

print(t+s)

Solution (Python):

import sys

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

s = input[0]
t = input[1]

print(t+s)

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

print(S[1] + S[0])

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

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 = (str(i) for i in input().split()) 

print(T+S)

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

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

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):
st1, st2 = map(str, input().split())

print(st2 + '' + st1)

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

Solution (Python):
st1, st2 = map(str, input().split())

print(st2 + '' + st1)

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)

Solution (Python):
A, B = input().split()
print("{1}{0}".format(A, B))

Solution (Python):
strings = input().split(" ")  
S = strings[0]
T = strings[1]
print(T, end="")
print(S, end="")

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

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

Solution (Python):

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

Solution (Python):
i=input()
t=i.split()[0]
s=i.split()[1]

print(s+t)

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

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

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

Solution (Python):
import resource
from sys import stdin
strings = list(stdin.readline().split())
print(strings[1] + strings[0])

Solution (Python):
S_T=input().split()
S=S_T[0]
T=S_T[1]
print(T+S)

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

Solution (Python):
s = input().split()
print(s[1] + s[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):
from sys import stdin
strings = list(stdin.readline().split())
print(strings[1] + strings[0])

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

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

mainFunc()

Solution (Python):
S, T = 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 = 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 = input().split()
print(T, S, sep="")

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

Solution (Python):
import sys
input = sys.stdin.readline
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 = input().split()
print(b+a)

Solution (Python):
import sys

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 = list(input().split())
result = t + s
print(result)

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

Solution (Python):
str1,str2=input().split()
print(str2+str1)

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):
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=map(str,input().split())
li=[]
li.append(t)
li.append(s)
print("".join(li))

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

print(t+s)

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

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

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

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

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

Solution (Python):



S, T = input().split()


res = T + S


print(res)

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

s_letter = list(s)
t_letter = list(t)

if(len(s_letter) > 100 or len(s_letter) == 0):
  raise ValueException("the length of S must be over 1 and under 100")
  
if(len(t_letter) > 100 or len(t_letter) == 0):
  raise ValueException("the length of T must be over 1 and under 100")  

for sl in s_letter:
  if(sl.isupper()):
    raise ValueException("the letter must be lowercase")
    
for tl in t_letter:  
  if(tl.isupper()):
    raise ValueException("the letter must be lowercase")
    
str = t + s
print(str)

Solution (Python):


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

Solution (Python):
inputValue = input()

output = ''.join(reversed(inputValue.split()))

print(output)

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

Solution (Python):
def main():
    [s, t] = input().split()
    print(t + s)

if __name__ == "__main__":
	main()

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

print(T + S)

Solution (Python):
L,R = input().split()
k = R + L
print (k)

Solution (Python):


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

Solution (Python):
L,R = input().split()
k = R + L
print (k)

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

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

Solution (Python):
S, T = input().strip().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):
from sys import stdin
a,b = [x for x in stdin.readline().rstrip().split()]
print(b+a)

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):
print("".join(input().split(" ")[::-1]))

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

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

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

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

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):
list = input().split(' ')
(S,T) = (list[0],list[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 = input().split()

ans = T + S

print(ans)

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

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(''.join([b, a]))

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

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

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

Solution (Python):
'''
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    
    return divisors

def bitlist(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res
'''

'''
n,m,t = list(map(int, input().split()))

nb = [[] for i in range(n+1)]
for i in range(n):
    a,b = list(map(int, input().split()))
    nb[a].append([b,i])
    nb[b].append([a,i])
print(nb)

order = [-1 for i in range(n+1)]
order[1] = 0
noworder = 1
nbnow = [len(nb[i])-1 for i in range(n+1)]

print(nbnow)
queue = [[1,999999]]
deque = 0

while(len(queue)>deque and len(queue)<20):
    nownum = queue[deque][0]
    nowpos = queue[deque][1]
    deque+=1
    print("a",nownum,nowpos)
    while(True):
        if(nb[nownum][nbnow[nownum]][1] > nowpos):
            nbnow[nownum] -= 1
        if(nbnow[nownum]<=-1):
            break
    if(nbnow[nownum]<=-1):
        continue
    
    nextnum = nb[nownum][nbnow[nownum]][0]
    nextpos = nb[nownum][nbnow[nownum]][1]
    print(nextnum,nextpos)
    if(order[nextnum]==-1):
        queue.append([nextnum,nextpos])
        order[nextnum]=noworder
        noworder+=1


print(order)
'''



a = list(map(str,input().split()))

print(a[1]+a[0])

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

print(n[1]+n[0])

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

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

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

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

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

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

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('{}{}'.format(t,s))

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

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

print(li[1] + li[0])

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

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

print(T + S)

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

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

a_r = []

for i in range(1,3):
  a_r.append(a[-i])
 
print(''.join(a_r))

Solution (Python):
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

def debug(*var, sep = ' ', end = '\n'):
    print(*var, file=sys.stderr, end = end, sep = sep)

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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(str(T) + str(S))

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

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

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

Solution (Python):
a=[str(i) for i in input().split()]
print(a[1]+a[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):
a,b=input().split()
print(b+a)

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):
a,b = input().split()
print(b+a)

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

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

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 = map(str, input().split())
print(T+S)

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

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

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):
a,b=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 = raw_input().split()
print T+S

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

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

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

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

print T + S

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

Solution (Python):
text=input()

s,t=text.split()

print(t+s)

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

print(T+S)

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

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

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):
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 = input().split()
print(s[1]+s[0])

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

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

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

print(''.join([T, S]))

Solution (Python):
s,t=map(str, input().split())
print(t,end='')
print(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 = 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, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def gcd(a, b):
  if a < b:
      a, b = b, a
  while a % b != 0:
      a, b = b, a % b
  return b
 

def lcm(a, b):
  y = a*b / gcd(a, b)
  return int(y)

s, t = S_MAP()

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=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):

import numpy as np
from functools import lru_cache
import time

def main(): 
    if True:
        N,X = list(map(str, input().split()))
    else:
        pass
    print(X+N)



if __name__ =='__main__':
    main()

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

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

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

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

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

print(b + a)

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

Solution (Python):
string = []

string = input().split()

print(string[1]+string[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 = input().split()

print(s[1]+s[0])

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

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

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

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

Solution (Python):



if __name__=='__main__':
  s, t = input().strip().split(' ')
  print(t+s)

Solution (Python):
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 = input().strip().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 = input().split()

print(t+s)

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

Solution (Python):
num = input()



num2 = num.split()

print(num2[1] + num2[0])

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

print(t + s)

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

print(s[1] + s[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 = list(input().split())
print(T + S)

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

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("{}{}".format(t, s))

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

Solution (Python):
s,t=input().split()
s=t+s
print(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):
x, y = input().split()
print(y+x)

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

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

Solution (Python):
from sys import stdin

A, B = stdin.readline().rstrip().split()

print(B + A)

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

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

Solution (Python):
S, T = input().split()
print(T, S, sep='', end="\n")

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 = input().split()
print(t + s)

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

Solution (Python):
S_T = str(input())
S = S_T.split(" ")[0]
T = S_T.split(" ")[1]
print(T + S)

Solution (Python):
S, T = [x for x in 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+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):
li=input().split()
print(li[1]+li[0])

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=[i for i in 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):
strs = input()
S,T = strs.split(" ")
print(T+S)

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

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

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

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)

Solution (Python):
def getdata_input():
    while True:
        yield input()
def callFunc2(it):
    
    S=[""]*2
    S[1],S[0]=next(it).split()
    return("".join(S))
it=getdata_input()
print(callFunc2(it))

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(1000000000)
from fractions import gcd
from itertools import count
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok


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

main()

Solution (Python):
import sys
s, t = [i for i in sys.stdin.readline().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 = map(str, input().split())

print(t+s)

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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):
s1 = input().split()
s1 = s1[::-1]
print("".join(s1))

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



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()
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())
res = t + s
print(res)

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

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

Solution (Python):
左,右=map(str,input().split())
print(右+左)

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
sys.setrecursionlimit(10000000)







INF = 500000
MOD = 10**9+7

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

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

Solution (Python):
def solve(s, t):
    return t + s

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

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

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

A()

Solution (Python):

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

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

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=list(input().split())
print(S[1]+S[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):
a = input().split()
print(a[1] + a[0])

Solution (Python):
li = input().split(' ')

print(li[1]+li[0])

Solution (Python):

a,b=map(str,input().split())


print(b+a)

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

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

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

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

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

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

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

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()
ans = t+s

print(ans)

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

Solution (Python):
import sys

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

print(T+S)

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

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

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

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

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

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = raw_input().split()
print B + A

Solution (Python):

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

print(t + s)

Solution (Python):
word1, word2 = input().split()

print(word2 + word1)

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 = map(str,input().split())
print(t+s)

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

print(T+S)

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

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

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

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

Solution (Python):
print(''.join(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):
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):

s=input().split()
ans=s[1]+s[0]
print(ans)

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

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

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

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

Solution (Python):
import os
import sys

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

if __name__ == '__main__':
    main()

Solution (Python):
s,t = map(str,input().split())
lst = []
lst.append(t)
lst.append(s)
print("".join(lst))

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)

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

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

Solution (Python):
s1,s2=map(str,input().split())
print(s2+s1)

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

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

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

Solution (Python):
s = input()
ss = s.split(" ")
S = ss[0]
T = ss[1]
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)