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

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
s, t = input().split()
print(t, s, sep="")

Submission status: Accepted

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

ans = t + s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
sys.setrecursionlimit(300000)


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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print("".join(word))

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
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())
print('{}{}'.format(T, S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S, T = input().split()

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


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

Submission status: Accepted

Solution code:

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ts = [t,s]

print("".join(ts))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = s[1] + s[0]

a.join('')
print(a)

Submission status: Accepted

Solution code:
import fileinput

s, t = input().split()

print(t + s)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_149_A()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 14:31:38 2020

@author: shinba
"""

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

Submission status: Accepted

Solution code:
# A - Strings

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(t + s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

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

print(solve())

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(b+a)

Submission status: Accepted

Solution code:
#N = int(input())
#l = [int(x) for x in input().split()]
s,t = input().split()
print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

S, T = input().split()

print(T + S)

Submission status: Accepted

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

Submission status: Accepted

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

print(T,S,sep='')

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

S, T = rs().split()

print(T+S)

Submission status: Accepted

Solution code:
N,M=[x for x in input().rstrip().split()]
# A=[int(x) for x in input().rstrip().split()]
print(M+N)

Submission status: Accepted

Solution code:
k, x =  input().split()
print(x + k)

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)

Submission status: Accepted

Solution code:
# a, b, c = map(int, input().split())
# if a == b and b == c:
#     print('No')
# elif a!=b and b!=c and c!=a :
#     print('No')
# else:
#     print('Yes')

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

Submission status: Accepted

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

print(T + S )

Submission status: Accepted

Solution code:
import sys
a, b = sys.stdin.readline().split()
print(b+a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=[str(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:

S, T = input().split()

print(T, S, sep='')

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

print(T,S,sep="")

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

Submission status: Accepted

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

Submission status: Accepted

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

print(b + a ,sep='')

Submission status: Accepted

Solution code:
#ライブラリの読み込み
import math

#入力値の格納
s,t = map(str,input().split())

#表示
print("{}{}".format(t,s))

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

print("".join(S))

Submission status: Accepted

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

print(t + s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations as perm
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    S, T = input(str, str)
    print(T + S)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

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

ans = t + s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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


if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
import math

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

print(t + s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
a,b =map(str, input().split())
print(str(b+a))

Submission status: Accepted

Solution code:
S, T = input().split() #文字列のスペース区切り
print(T + S)

Submission status: Accepted

Solution code:
a = input().split()
a = a[::-1]
a = ''.join(a)
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t + s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t =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("%s%s" %(t,s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(str,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))





s,t=input2()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
#A
S,T=input().split()
print(T+S)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#---Strings
S, T = map(str, input().split(" "))
print(T, S, sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def stringconcant(S,T):
     a=S 
     b=T
     c=a+b
     return c

S,T = input().split()
a = stringconcant(T,S)
print(a)

Submission status: Accepted

Solution code:
def scc(W,F):
    a = W
    b = F
    c = a+b
    return c

W,F= input().split()
a = scc(F,W)
print(a)

Submission status: Accepted

Solution code:
def stringconcant(S,T):
    x = S
    b = T
    c = x+b
    return c

S,T= input().split()
x = stringconcant(T,S)
print(x)

Submission status: Accepted

Solution code:
#ddfdfdf
#djfkdnfjdnfjfn
#sjhdjhfjdf
def stringconcant(S,T):
    d = S
    h = T
    r = d+h
    return r

S,T= input().split()
d = stringconcant(T,S)
print(d)

Submission status: Accepted

Solution code:
def stringconcant(T,U):
    a = T
    b = U
    c = a+b
    return c

T,U= input().split()
a = stringconcant(U,T)
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string_1, string_2 = input("").split()
print(string_2+string_1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# /home/remina/PycharmProjects/atcoder/A-Strings.py
#

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

Submission status: Accepted

Solution code:
def stringconcant(S,T):
    a = S
    b = T
    c = a+b
    return c

S,T= input().split()
a = stringconcant(T,S)
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#---Strings
S, T = map(str, input().split(" "))
print(T, S, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

t = t+s
print(t)

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s, t = input().split()
print(t + s)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
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 debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(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()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(b+a)

Submission status: Accepted

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

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

answer = T + S

print(answer)

Submission status: Accepted

Solution code:
# 初期入力
S,T = map(str, input().split())
print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

S, T = stdin.readline().rstrip().split()

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 149: A – Strings
s, t = [s for s in input().split()]
print(t + s)

Submission status: Accepted

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

Submission status: Accepted

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

ans = t + s
print(ans)

Submission status: Accepted

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

INF = float('inf')


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S, T = sr().split()
answer = T + S
print(answer)
# 39

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st=input().rstrip().split(" ")
s=st[0]
t=st[1]
print(t,end="")
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
base = input().split()
print(base[1],end="")
print(base[0])

Submission status: Accepted

Solution code:
import sys

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

def main():
    print(t + s)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = T + S
print(ans)

Submission status: Accepted

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

print(t,s,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

output = t + s
print(output)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = a[::-1]



print(''.join(a))

Submission status: Accepted

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

main()

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

answer = T + S

print(answer)

Submission status: Accepted

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