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

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

Solution (Python):
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict

sys.setrecursionlimit(10**7)
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 examA():
    S, T = LSI()
    ans = T+S
    print(ans)
    return

def examB():
    return

def examC():
    return

def examD():
    return

def examE():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,inf
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

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

print(t + s)

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    s, t = rl()
    print(t+s)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

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

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

S,T=LS()
print(T+S)

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

print(T+S)

Solution (Python):
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline



    a, b = input().split()
    print(b + a)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,b = LS()

    return "".join([b,a])


print(main())

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

print(t + s)

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

Solution (Python):
st=input().split(" ")
print(st[1]+st[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):
def main():

    S, T = input().split()
    return T + S


if __name__ == '__main__':
    print(main())

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):
import sys
input = sys.stdin.readline


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

print(b+a)

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

Solution (Python):


S, T = input().split()

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

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

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

print(T + S)

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

print(T+S)

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

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

print(Ts+Ss)

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

Solution (Python):
from sys import stdin
S,T = [(x) for x in stdin.readline().rstrip().split()]
print(T+S)

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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)

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

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

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

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

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

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

Solution (Python):
import sys

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

def main():
    return t + s

if __name__ == '__main__':
    ans = main()
    print(ans)

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S,T=ST().split()
    print(T,S,sep="")
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(T, end = "")
print(S)

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


if __name__ == '__main__':
    main()

Solution (Python):
import math
import bisect
import collections
import itertools
def gcd(a,b):return math.gcd 
def lcm(a,b):return (a*b) // math.gcd(a,b) 
def iin(): return int(input()) 
def imn(): return map(int, input().split()) 
def iln(): return list(map(int, input().split())) 
def iln_s(): return sorted(iln()) 
def iln_r(): return sorted(iln(), reverse=True) 
def join(l, s=''): return s.join(l) 
def perm(l, n): return itertools.permutations(l, n) 
def comb(l, n): return itertools.combinations(l, n) 
def 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

S,T = input().split()

print(T+S)

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 = 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 = 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):
S,T=map(str,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 = 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 = 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=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):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


a,b = input().split()

print(b+a)

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

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

ans = t + s
print(ans)

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


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
    print(t + s)


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

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


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

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

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

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




T, S = sys.stdin.buffer.readline().decode().rstrip().split()
print(S+T)

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

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

Solution (Python):

import sys
INF = float("inf")


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

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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