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



Sample input:
oder atc


Sample output:
atcoder

Submission status: Accepted

Solution code:
def ints():
  return [int(x) for x in input().split()]
def ii():
  return int(input())
print(''.join(reversed(input().split())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input().split(' ')
print(str[1] + str[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inpt = input()

inpt = inpt.split(" ")
print(inpt[1]+inpt[0])

Submission status: Accepted

Solution code:
words = input().split(' ')
S = words[0]
T = words[1]
new_word = []
 
for i in T:
    new_word.append(i)

for i in S:
    new_word.append(i)
    
print("".join(new_word))

Submission status: Accepted

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

Submission status: Accepted

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

print("%s%s" % (T, S))

Submission status: Accepted

Solution code:
S,T=input().split()
print(T,end="")
print(S)

Submission status: Accepted

Solution code:
s, t = input().strip().split()

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S,T = read().decode('utf-8').split()

answer = T + S
print(answer)

Submission status: Accepted

Solution code:
#A
s,t=map(str, input().split())
print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = input().split(" ")
print("{0}{1}".format(st[1],st[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    A, B = input().split()
    print(B + A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()    
m = n.split()
p = [i for i in m]
a = p[1]+p[0]
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import math
import fractions

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

Submission status: Accepted

Solution code:
s = list(map(str, input().split()))

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

Submission status: Accepted

Solution code:
S=input().split()
print("".join(S[::-1]))

Submission status: Accepted

Solution code:
S_T = input().split()
S = S_T[0]
T = S_T[1]

print(T+S)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

print(T+S)

Submission status: Accepted

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

print(T,S,sep='')

Submission status: Accepted

Solution code:
ST = input().split()
print(ST[1] + ST[0], sep = "")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().split()
List = []
for i in range(len(b)):
  x = b[i]
  List.append(x)
  
for i in range(len(a)):
  x = a[i]
  List.append(x)
  
p=List[0]
for i in range(1,len(List)):
    p=p+List[i]
    
print(p)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(S: str, T: str):
    print(''.join([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)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ST = input().split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = (i for i in input().split())
print("{}{}".format(b, a))

Submission status: Accepted

Solution code:
S,T = input().split()
print(T, end='')
print(S)

Submission status: Accepted

Solution code:
u = input().split()
S = u[0]
T = u[1]
ans = T + S
print(ans)

Submission status: Accepted

Solution code:
i = input().split()
ans = i[1] + i[0]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 , s2 = input().split()

print(s2+s1)

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

S, T = input().split()

print(T + S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

string = t + s

print(string)

Submission status: Accepted

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

print(T + S)

Submission status: Accepted

Solution code:
# coding:utf-8

S, T = input().split(' ')

print(T+S)

Submission status: Accepted

Solution code:
s, t = map(str, input().split())
print(t, end="")
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve():
    return T + S


print(solve())

Submission status: Accepted

Solution code:
S,T = input().split()
str=T+S

print(str)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(T, S, sep='')

Submission status: Accepted

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

ans = str(n[1])+str(n[0])

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = list(input().split())
ts = "".join(st[::-1])

print(ts)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#take inputs
S, T = map(str, input().lower().split())
#concatenate strings
print(T+S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S, T = map(str, input().split())
print("{}{}".format(T,S))

Submission status: Accepted

Solution code:
s, t = input().split()
print("".join([t, s]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
S, T = list(map(str,input().split()))

ans = T + S
print(ans)

Submission status: Accepted

Solution code:
n,k=map(str,input().split())
print(k,end="")
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b = input().split()
print(b+a)

Submission status: Accepted

Solution code:
data = input()
a = data.split(' ')
b, c = a[0],a[1]
print(c+b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
	S, T = input().split()
	print(T + S)

Submission status: Accepted

Solution code:
str=input().split(" ")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mystr = str(input())
strs = mystr.split(' ')
print(strs[1] + strs[0])

Submission status: Accepted

Solution code:
S,T = input().strip().split(' ')
print('{}{}'.format(T,S))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
n, k = map(str, input().split())
print(k+n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = input().strip().split()

print(T + S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st=list(input().split())

ans=st[1]+st[0]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


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

Submission status: Accepted

Solution code:
list = []
inp = input()
list = inp.split(" ")

for i in list :
    res = list[1] + list[0]
print(res)

Submission status: Accepted

Solution code:
S, T = input().strip().split()

print(T+S)

Submission status: Accepted

Solution code:
s = input().split()
S = s[0]
T = s[1]
W1=T+S
print(W1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=map(str,input().split())
ss=list(s)
tt=list(t)
print(''.join(tt)+''.join(ss))

Submission status: Accepted

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

print(B+A)

Submission status: Accepted

Solution code:
S, T = input().split()
print("{0}{1}".format(T, S))

Submission status: Accepted

Solution code:
s = input().split(" ")

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

Submission status: Accepted

Solution code:
import os
nyu = input().split()
S=nyu[0].strip()
T=nyu[1].strip()
print(T+S)

Submission status: Accepted

Solution code:
def main():
	n,k = map(str,input().split())
	# n = int(input())
	# s = str(input())
	# h = list(map(int,input().split()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	# s = list(s)

	print(k+n)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [i for i in input().split()[::-1]]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('oder', 'atc'), 'atcoder')

    def test_2(self):
        self.assertEqual(think('humu', 'humu'), 'humuhumu')


def solve():
    s, t = read()
    result = think(s, t)
    write(result)


def read():
    return read_line().split()


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(s, t):
    return t + s


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

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

print(t, end = "")
print(s)

Submission status: Accepted

Solution code:
S, T = map(str, input().split())
a = [T, S]
print(''.join(a))

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


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

    
    return

# B


def B():
    N, X = LI()
    L = LI()

    ans = 1
    D = 0
    for i in range(2, N+2):
        D = D+L[i-2]
        if (D > X):
            break
        ans += 1
    print(ans)

    return

# C


def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def flagcounter(x):
    if (x == 0):
        return 0
    return flagcounter(x >> 1)+(x & 1)


def C():
    W, H, x, y = LI()

    if (W/2 == x and H/2 == y):
        print(W*H/2, 1)
    else:
        print(W*H/2, 0)

    return


# D


def D():

    N, K = LI()
    A = LI()
    MAX = sum(A)
    if MAX < K:
        print(0)
        return
    Temp = MAX
    ans = 1
    for i in range(N):
        Temp = Temp-A[i]
        if (Temp >= K):
            ans += 1
        else:
            T = Temp+A[i]
            break
    Temp = T
    ckeep = N
    for k in range(N):
        c = N-1
        i -= 1
        Temp = T

        for j in range(N):
            Temp = Temp-A[c]
            if (Temp >= K ):
                ans += 1
            
            elif(c < ckeep and i>=0):
                ans += i
                ckeep = c
                break
            else:
                ckeep = c
                break
            c -= 1
        if i < 0:
            break
        T = T+A[i]
    print(ans)

    return

# E


def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':

    A()

Submission status: Accepted

Solution code:
s, t = map(list, input().split())


t.extend(s)
print("".join(t))

Submission status: Accepted

Solution code:
S,T = list(map(str, input().split()))
ans = ""
ans += T
ans += S

print(ans)

Submission status: Accepted

Solution code:
#A
s, t = list(map(str,input().split()))
print(''.join(t+s))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

S, T = input().split()

print(T + S)

Submission status: Accepted

Solution code:
S, T = map(str, input().split())
A = T[:] + S[:]
print(A)

Submission status: Accepted

Solution code:
import numpy as np

DEBUG = True

def dprint(*args):
    if DEBUG:
        print(*args)

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

print(t+s)

Submission status: Accepted

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

print(str(t+s))

Submission status: Accepted

Solution code:
import sys
a,b=input().strip().split()
print(b+a)

Submission status: Accepted

Solution code:
# coding: utf-8


def main():

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

    print(t + s)

    return 0

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = input().split()
print(b, end='')
print(a)

Submission status: Accepted

Solution code:
n,m=map(str,input().split())
ans=m+n
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[S, T] = list(map(str, input().split()))
ans = T + S
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
lines = stdin.readlines()
 
A, B = map(str, lines[0].split())

print(B + A)

Submission status: Accepted

Solution code:
[s, t] = input().split(" ")
print(t + s)

Submission status: Accepted

Solution code:
A,B = map(str, input().split())
print("{}{}".format(B,A))

Submission status: Accepted

Solution code:
a = input().split()
s,t = a[0],a[1]
print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def f(S,T):
    return T+S
S,T= map(str,input().split())
print(f(S,T))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
import sys


def main():
  a, b = input().split(' ')
  print(b+a)
  
  
  return 0


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- Coding: utf-8 -*-


l = list(map(str, input().split()))
temp = l[0]
l[0] = l[1]
l[1] = temp

print("".join(l))

Submission status: Accepted

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

ans = T+S
print(ans)

Submission status: Accepted

Solution code:
li = list(input().split())
s=li[0]
t=li[1]

print(t+s)

Submission status: Accepted

Solution code:
k=input().split()
p=k[1]+k[0]
print(p)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(str, input().split())


print(B +A)

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
import sys

def main():
    ST = input().split()
    print('{0}{1}'.format(ST[1], ST[0]), end="")

main()

Submission status: Accepted

Solution code:
strings = input().split()

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

Submission status: Accepted

Solution code:
i, _i = map(str, input().split())
print("{}{}".format(_i, i))

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc149/abc149_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    S, T = i2s().split(' ')
    print(T+S)
    return

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

Solution code:
ST = str(input()).split(' ')
S = ST[0]
T = ST[1]
string = T+S
print(string)

Submission status: Accepted

Solution code:
H = list(map(str, input().split()))
S = H[0]
T = H[1]
L=T+S
print(L)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#output
print(T, S, sep = "")

Submission status: Accepted

Solution code:
# 1行目の入力を空白で分割された文字列として扱う
S, T = map(str, input().split())

# 答えの出力
print(T + S)

Submission status: Accepted

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

print(str(T+S))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

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

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s = map(str,input().split())

print(s+a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string_pair = input().split(" ")
string_1 = string_pair[0]
string_2 = string_pair[1]
print(string_2 + string_1,sep ="")

Submission status: Accepted

Solution code:
# ABC149 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
s,t=map(str, input().split())

ans=''
ans+=t
ans+=s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
in_li = input().split()
res = ""
res += in_li[1]
res += in_li[0]
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = (str(i) for i in input().split())
print (b+a)

Submission status: Accepted

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

Submission status: Accepted

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

print(b + a)

Submission status: Accepted

Solution code:
def multi_input():
    return input().split()
  
multi_input = multi_input()
print(multi_input[1]+multi_input[0])

Submission status: Accepted

Solution code:
S,T=raw_input().split()
print T+S

Submission status: Accepted

Solution code:
first, second = input().split()
print(second+first)

Submission status: Accepted

Solution code:
A1,A2=map(str,input().split())
print(A2,A1,sep="")

Submission status: Accepted

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

print(t+s, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# print('input >>')
S, T = (input().split())

# print('-----output-----')
print(T, end='')
print(S, end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
point=0
T=''
for i in range(len(S)):
    if S[i]==' ':
        point=i

for i in range(point+1,len(S)):
    T+=S[i]

for i in range(point):
    T+=S[i]

print(T)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S, T = input().split()
    print(''.join([T, S]))


main()

Submission status: Accepted

Solution code:
ST = list(input().split())
S = ST[0]
T = ST[1]
TS = [0 for i in range(2)]
TS[0] = T
TS[1] = S
s ="".join(TS) 
print(s)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

u = t+s

print(u)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S,T=input().split()

print(T+S)

Submission status: Accepted

Solution code:
a,b = [i for i in input().split()]
print("".join([b,a]))

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(T, S, sep = "")

Submission status: Accepted

Solution code:
inp = input()
S = inp.split(" ")[0]
T = inp.split(" ")[1]

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

u = t + s 
print(u)

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
S, T = input().split()
print("".join([T,S]))

Submission status: Accepted

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

t += s

print(t)