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

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

r=t+s

print(r)

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 = list(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, sep='')

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

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

Solution (Python):

import sys
from itertools import chain


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


def main():
    tokens = chain(*(line.split() for line in sys.stdin))
    S = next(tokens)  
    T = next(tokens)  
    answer = solve(S, T)
    print(answer)


if __name__ == "__main__":
    main()

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

print(T + S)

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

Solution (Python):
str_l = list(map(str, input().split()))
print(''.join(list(reversed(str_l))))

Solution (Python):
a, b = map(str, input().split())
print('{}{}'.format(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):
s, t = map(list, input().split())
t.extend(s)
print(''.join(t))

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()
ans = T + S
print(ans)

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


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


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
 
S, T = next(sys.stdin).strip().split()
print(T + S)

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 = 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,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()

u = t + s

print(u)

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush

from functools import reduce,lru_cache

from decimal import Decimal
from argparse import ArgumentParser

args=ArgumentParser()
args.add_argument('-loc', '--local', type=bool,default=False)
LOCAL=args.parse_args().local

def input(): 
    x=sys.stdin.readline(); 
    if x[-1]=="\n": 
        return x.rstrip() 
    return x
    
def printe(*x):_=print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): 
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    

    
    a,b = input().split()
    
    
    
    l=[a,b]

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



if __name__ == "__main__":
    main()

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

print(T + S)

Solution (Python):
a,b=input().split()
for i in b,a:
  print(i,end="")

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

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

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

if __name__ == "__main__":
    solve()

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

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

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

Solution (Python):
A,B = map(str,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, sep = "", end="")

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

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

    ans = T + S

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    S, T = LS()

    print(T + S)

if __name__ == '__main__':
    resolve()

Solution (Python):
s, t = map(str,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()
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):
a=input().split()
print(a[1]+a[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()
print(t + s)

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

Solution (Python):

S,T = input().split()


print(T + S)

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

Solution (Python):
word = list(map(str,input().split()))
print(word[1],end=(''))
print(word[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()
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=input().split()
print(t+s)

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    print(f'{solve(S, T)}')


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a = input().split()
print(f"{a[1]}{a[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 = map(str, input().split())
print(t+s)

Solution (Python):
S,T = open(0).read().split()
print(T+S)

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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())
print(''.join([t, s]))

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

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

print("".join(reversed(a)))

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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 bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    S,T = LS()
    print(T+S)

main()

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

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

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

print(t+s)

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

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):
X, A = [i for i in input().split()]
print(A + X)

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):
A,B = map(str,input().split())
print(B+A)

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

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

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

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

Solution (Python):
s, t = list(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):


def main():

    S, T = input().split()

    ans = T + S

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

if '__main__' == __name__:
    resolve()

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

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):
str = input().split(" ")

print(str[1], end="")
print(str[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=map(str,input().split())

print(b+a)

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

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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

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

print(t,s,sep="")

Solution (Python):





































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    S, T = list(lines[0].split())
    
    
    
    
    
    
    
    

    result = T + S

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['oder atc']
        lines_export = ['atcoder']
    if pattern == 2:
        lines_input = ['humu humu']
        lines_export = ['humuhumu']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    s, t =  input().split()
    print(t, s, sep='')
    
if __name__ == '__main__':
    main()

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

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

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

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

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

print(t + s)

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

Solution (Python):
a,b=[str(i) for i in  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 = 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)

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

Solution (Python):
s = input().split()
print(''.join(reversed(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):
t=input().split()
print(t[1]+t[0])

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

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

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

if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()

print(T,S,sep='')

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

if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()

print(T,end='')
print(S)

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

Solution (Python):


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

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

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

Solution (Python):
l = input().split()
s,t = l[0], l[1]
print(t+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 = map(str, input().split())
    print(t+s)

if __name__ == "__main__":
    main()

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

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

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

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

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):
S,T=input().split()
print('{}{}'.format(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 = list(map(str, input().split()))
 
print(S[1] + S[0])

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

Solution (Python):
S = list(input().split())[::-1]

res = "".join(S)

print(res)

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

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

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

Solution (Python):
st = input().split()
st.reverse()
print(''.join(st))

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

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

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

Solution (Python):
def strings(s, t):

    return t+s

def main():
    s, t = map(str, input().split())
    print(strings(s, t))

if __name__ == '__main__':
    main()

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(f"{t}{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)
  
  
main()

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

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

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

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

print(str(t) + str(s))

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

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

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

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

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

Solution (Python):



a = list(input().split())


print("".join(a[::-1]))

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

print(T+S)

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys




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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
inf = 10**17
mod = 10**9+7


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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    return


if __name__ == '__main__':
    main()

Solution (Python):


import io
import sys
import math

def solve():
    
    pass

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

_DEB = 0   

_INPUT = """\
humu humu
"""
_EXPECTED = """\
humuhumu

"""

def logd(str):
    """usage:
    if _DEB: logd(f"{str}")
    """
    if _DEB: print(f"[deb] {str}")


if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    ans = main()

    if _DEB:
        print()
        if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
        else: print(f"!! Failed... !!\nANSWER:   {ans}\nExpected: {_EXPECTED}")

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

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

Solution (Python):
import sys












stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    
    s,t = map(str, stdin.readline().rstrip().split())
    
    
    
    
    
    print(t+s)

if __name__ == '__main__':
    solve()

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

print(T + S)

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

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

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

Solution (Python):
st = input()

list = (st.split())

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

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

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