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: Runtime Error

Solution code:
input_list = list(map(int, input().split()))
games = input_list[0]
temp = input_list[1]
input_list = list(map(int, input().split()))
r = input_list[0]
s = input_list[1]
p = input_list[2]
target = input()

def no_win_hand(next_hand):
  myhand = win_janken(next_hand)
  return myhand

def get_point(myhand):
  if myhand == 'r':
    point = r
  elif myhand == 's':
    point = s
  else:
    point = p
  return point

def win_janken(hand, next_hand = 'non', donate = 'non'):
  if hand == 'r':
    myhand = 'p'
  elif hand == 's':
    myhand = 'r'
  else:
    myhand = 's'
  point = get_point(myhand)
  if myhand == donate:
    nothand = no_win_hand(next_hand)[0]
    select_hands = ['r','s','p']
    for hand_1 in select_hands:
      if hand_1 is not donate and  hand_1 is not nothand:
        myhand = hand_1
    point = 0
  return myhand, point

allpoint = 0
for m in range(temp):
  group = ''
  for ind, n in enumerate(target):
    if ind % temp == m:
       group += n
  points = 0
  myhands =''
  for index, string in enumerate(group):
    if len(myhands) > 0:
      donate = myhands[index - 1]
    else:
      donate = 'non'
    if index < len(group) - 1:
      myhand, point = win_janken(string, group[index + 1], donate)
    else:
      myhand, point = win_janken(string, 'non', donate)
    points += point
    myhands += myhand
  allpoint += points
print(allpoint)

Submission status: Runtime Error

Solution code:
s,t = input()

print(s + t)

Submission status: Runtime Error

Solution code:
import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner s=new Scanner(System.in);
    String p=s.next();
    String t=s.next();
    String c=t+p;
    System.out.println(c);
  }
}

Submission status: Runtime Error

Solution code:
s=input('enter 1st stinrg')
t=input('second strin')
print(t+s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
s3 = s2 + s1
print(s3)

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
print(s2 + s1)

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
print(s2 + s1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,K =map(int,input().split())
if A >= K:
  print(A-K,B)
elif B-(K-A) >= 0:
  print(0,B-(K-A))
else:
  print(0,0)

Submission status: Runtime Error

Solution code:
S=input()
T=input()
U=T+S
Print(U)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input.split()
print(''.join(a))

Submission status: Runtime Error

Solution code:
A,B,K=list(map(int,input().split()))

if A==0 and B==0:
  pass
elif A>0:
  if A>=K:
  	A = A-K
  elif A+B>K:
    B = B-K+A
    A = 0
  else:
    A=0
    B=0
elif B>K:
  B=B-K
else:
  B=0
print('%d %d' % (A,B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Takahashi = int(A)
Aoki = int(B)
count = int(K)

t = 0

for i in range(count):
    Takahashi = Takahashi-1
    t = t+1
    if t == count:
        break
    elif Takahashi < 0:
        Takahashi = 0
        Aoki = Aoki-1
        t = t+1
        if Aoki == 0:
            print(Takahashi, Aoki)
            break
    else:
        continue


print(Takahashi, Aoki)

Submission status: Runtime Error

Solution code:
import bisect
import sys
from itertools import accumulate
input = sys.stdin.readline
def hsnum(ls,x,n):
    num = 0
    for i in range(n):
        y = x-ls[i]
        num += n-bisect.bisect_left(ls,y)
    return num
n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
suma = [0]+list(accumulate(a))
lx = 0
rx = 2*10**5+2
error = 0
while lx < rx:
    mx = (lx+rx)//2
    if hsnum(a,mx,n) < m:
        rx = mx
    elif hsnum(a,mx,n) > m:
        if hsnum(a,mx+1,n) < m:
            error = hsnum(a,mx,n)-m
            lx = mx
            break
        lx = mx + 1
    else:
        lx = mx
        break
ans = 0
for i in range(n):
    rema = lx - a[i]
    j = bisect.bisect_left(a,rema)
    ans += (n-j)*a[i]+suma[n]-suma[j]
print(ans-error*lx)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

S, T = map(int, sys.stdin.readline.split())

print(S+T)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print (T + S)

Submission status: Runtime Error

Solution code:
sub Main(a, b)
  print (b + a)

Submission status: Runtime Error

Solution code:
word1 = input()
word2 = input()

print(word1 + word2)

Submission status: Runtime Error

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

X = int(input())
done = False
while not done:
    a = make_divisors(X)
    if len(a) == 2:
        done = True
        c = X
    else:
        X += 1
       

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
x=int(input())
primemode = True
while primemode:
  sos = True
  for n in range(math.floor(math.sqrt(x))):
    if n+1 != 1:
      if x%(n+1) == 0:
        sos = False
  if sos:
    primemode = False
  else:
    x = x+1
print(x)

Submission status: Runtime Error

Solution code:
import math
x=int(input())
primemode = True
while primemode:
  x = x+1
  sos = True
  for n in range(math.floor(math.sqrt(x))):
    if n+1 != 1:
      if x%(n+1) == 0:
        sos = False
  if sos:
    primemode = False
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if c<a:
    print(a-c,b)
else:
    print(0,b+a-c)

Submission status: Runtime Error

Solution code:
s=input()
t=input()
print(t+s'\n')

Submission status: Runtime Error

Solution code:
import sys

def main():
    l=sys.stdin.readline().split()
    print l[1]+l[0]

main()

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input())
c = min(a,k)
a -= c
k -= c
b -= min(b, k)
print(a, b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N , K = map(int , input().split())
R , S , P = map(int , input().split())
T = input()

dic = {"r":"p" , "s":"r" , "p":"s"}
ANS = []

for i in range(N):
    ANS.append(dic[T[i]])
    
ans = "".join(ANS)

VANISH = []
    
for i in range(N-K):
    if ans[i] == ans[i+K]:
        VANISH.append(ans[i])
        
if N - (2*K) > 0:
    for i in range(N - (2*K)):
        if ans[i] == ans[i+(2*K)]:
            VANISH.remove(ans[i])
            
vanish = "".join(VANISH)
        
point = ((ans.count("r")-vanish.count("r"))*R + (ans.count("s")-vanish.count("s"))*S + (ans.count("p")-vanish.count("p"))*P)

print(point)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, k = input().split()
a = int(a)
b = int(b)
k = int(k)
for i in range(k):
  if a >= 1:
    a -= 1
  elif b >= 1:
    b -= 1
  else:
    continue
    
print("{} {}".format(a, b))

Submission status: Runtime Error

Solution code:
x=0
A,B,K = input().split()
while (int(A)>0):
  x=int(x)+1
  A=int(A)-1
  if(x>int(K)):
    break
while (int(B)>0):
  x=int(x)+1
  B=int(B)-1
  if(x>int(K)):
    break
if(A>0):
  A=int(A)+1
if(B>0):
  B=int(B)+1
print(format(A)+' '+format(B))

Submission status: Runtime Error

Solution code:
primes=[2]
x = int(input())
if x == 2:
  print(x)
else:
  i = 3
  while True:
    for p in primes:
      if i % p == 0:
        break
    else:
      primes.append(i)
      if x <= i:
        break
    i+=1
  print(primes[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
T=input()

print(T+S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input().split("区切り文字")
T=input().split("区切り文字")
print(S+T)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print("{}{}".format(b,a))

Submission status: Runtime Error

Solution code:
import math
n = int(input()) 

def is_prime(n):
    if n == 1: return True

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
    return True

if(is_prime(n)):
    print(n)
else:
    while(is_prime(n) == False):
        n = n + 1
        is_prime(n)
    print(n)

Submission status: Runtime Error

Solution code:
s = input("Enter your string for S: ")
t = input("Enter your string for T: ")
print (t+s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(''.join(sorted(S+T)))

Submission status: Runtime Error

Solution code:
x = int(input())
while True:
    if x % 2 != 0:    
        for m in range(3,int(x**0.5)+4,2):
            if x % m == 0 and x < m:
                break
        else:
            break
    x += 1
print (x)

Submission status: Runtime Error

Solution code:

A, B, K = map(int, input().strip().split(" "))

if A > K:
    A -= K
    K = 0

else:
    K -= A
    A = 0

if B > K:
    B -= K
    K = 0

else:
    B = 0
    
print("{} {}".format(A, B))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(input().lower() + input().lower())

Submission status: Runtime Error

Solution code:
X =int(input())
def f(n):
    for i in range(2,int(n**0.5)+1):
        if n%i == 0:
            return False
    return True
for i in range(X,100004):
    if f(i):
        return(i)
        break

Submission status: Runtime Error

Solution code:
a=input()
b=input()
print(a+b)

Submission status: Runtime Error

Solution code:
T = input().lower()
S = input().lower()

print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T = input()
S = input()

print(T + S)

Submission status: Runtime Error

Solution code:
the_string = raw_input()
name, age = the_string.split()
print(age+name)

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
b = a[0] - a[2]
if b <= 0:
  ans = a[1] + b
  if ans < 0:
    print('0 0')
  print('0 {}'.format(ans))
elif b == 0:
  print('0 {}'.format(a[1]))

elif b > 0:
  print('{} {}'.format(b, a[1]))

Submission status: Runtime Error

Solution code:
from sys import stdin

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

print(T+S)
from sys import stdin

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

print(T+S)

Submission status: Runtime Error

Solution code:
T = input()
S = input()

print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import fractions
X = int(input())

def qprime(n):
    if n<2:return False
    elif n==2:return True
    elif n%2==0:return False
    for i in range(3,math.floor(math.sqrt(n))+1,2):
                   if n % i == 0:return False
    return True


for i in range(X,100000):
    if qprime(i):
        print(i)
        break

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x=int(input())
li=[2]
p=2
i=0
prime=False
if x==2:
    print(2)
else:
    while p<x or prime==False:
        prime=True
        p+=1
        for i in range(len(li)):
            if p%li[i]==0:
                prime=False
        if prime:
            li.append(p)
   
    print(max(li))

Submission status: Runtime Error

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

for i in range(k):
  if a > 0:
  	a -= 1
  else:
    b -= 1
print(a,b)

Submission status: Runtime Error

Solution code:
a,b,k = (int(x) for x in input().split())

if k >= a :
  if k >= b :
    if a + b >= k :
      a1 = 0
      b1 = b - k + a
    else :
      a1 = 0
      b1 = 0
  else :
    a1 = 0
    b1 = b - k + a
else :
  a1 = a - k
  b1 = b

print(a1,b1)

Submission status: Runtime Error

Solution code:
s = input()
print(s.repliace(' ', ''))

Submission status: Runtime Error

Solution code:
s = input()
print(s.repliace(' ', '')

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
b = a[0] - a[2]
if b <= 0:
  ans = a[1] + b
  print('0 {}'.format(ans))
else:
  print('{} {}'.format(b, a[1]))

Submission status: Runtime Error

Solution code:
N = int(input())
def sieve(n, s):
    num = [True]*n
    num[0] = num[1] = False
    for i in range(2,int(n**0.5)+1):
        if num[i]:
            for j in range(i**2, n, i):
                num[j] = False
    return [i for i in range(2,n) if num[i] and i > s]
print(sieve(int(N*1.2), N)[0])

Submission status: Runtime Error

Solution code:
a=str(raw_input())
b=str(raw_input())
print(a+b)

Submission status: Runtime Error

Solution code:
S＝ input()
T＝ input()
print(T ＋ S)

Submission status: Runtime Error

Solution code:
A = list(map(int,input().split()))
for i in range(A[2]):
    if A[0] > 0:
        A[0] -= 1
    elif A[1] > 1:
        A[1] -=1
print(A[0],A[1])

Submission status: Runtime Error

Solution code:
S， T ＝ map(str，input())
print(T ＋ S)

Submission status: Runtime Error

Solution code:
N = int(input())
def sieve(n, s):
    num = [True]*n
    num[0] = num[1] = False
    for i in range(2,int(n**0.5)+1):
        if num[i]:
            for j in range(i**2, n, i):
                num[j] = False
    return [i for i in range(2,n) if num[i] and i > s]
print(sieve(N*2, N)[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
function sort(S,T){
  var str1=S;
  
  var str2 =T;
  var res=(str1.split("")).concat(str2.split(""));
  return res;
}

Submission status: Runtime Error

Solution code:
s, t = input()
s = str(s)
t = str(t)

result = t+s
return result

Submission status: Runtime Error

Solution code:
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String a = s.nextLine();
        String b = s.nextLine();
        String c = b.concat(a);
        System.out.println(c);
    }
}

Submission status: Runtime Error

Solution code:
line = input().split(' ')
A = int(line[0])
B = int(line[1])
K = int(line[2])
Z = 0

def p2(num1, num2, Z):
  if Z:
    return(0)
  else:
    if(num1 < num2):
      return (num2 - num1)
      Z = 1
    else:
      return(0)
  
print(str(p2(K, A, Z)) + ' ' + str(p2(K - A, B, Z)))

Submission status: Runtime Error

Solution code:
a,b,k=(long(i)for i in input().split())
while 0<k:
    if 0<a:a=a-1
    elif 0<b:b=b-1
    k=k-1
print(a,b)

Submission status: Runtime Error

Solution code:
a=str(input())
b=str(input())
print(a+b)

Submission status: Runtime Error

Solution code:
the_string = input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100 and len(S)>=1 and len(T)>=1):
    S = S.lower()
    T = T.lower()
    if (ord(S[0]) < ord(T[0])):
        print(S+T)
    elif (ord(S[0]) > ord(T[0])):
        print(T+S)
    elif (ord(S[0]) == ord(T[0])):
        print(T+S)
else: 
    return null

Submission status: Runtime Error

Solution code:
A, B, K  = list(map(int, input().split()))
for i in range(K):
    if A >= 1:
        A = A-1
    elif B >= 1:
        B = B-1
    elif A == 0 and B == 0:
        break
print(A,B)

Submission status: Runtime Error

Solution code:
s = str(input())
t = str(input())

print(t+s)

Submission status: Runtime Error

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

for i in range(k):
    if a > 0:
        a = a - 1
    elif b > 0:
        b = b - 1

print(a, b)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
print(b + a)

Submission status: Runtime Error

Solution code:
n = int(input())


def prime(n):
    if n == 1:
        n += 1
    while True:
        flag = 0
        for k in range(2, int(n**0.5) + 1):
            if n % k == 0:
                flag = 1
                break
        if flag == 0:
            return n
        n += 1


ans = prime(n)
print(ans)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def main():
    StringS = input();
    StringT = input();

    print(StringT+StringS);

main()

Submission status: Runtime Error

Solution code:
the_string = raw_input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100):
    S = S.lower()
    T = T.lower()
    if (ord(S[0]) < ord(T[0])):
        print(S+T)
    elif (ord(S[0]) > ord(T[0])):
        print(T+S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
arr = input().split()
s = arr[0]
t = arr[1]
print(f'{t}{s}')

Submission status: Runtime Error

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

if a-k>=0:
    print(int(a-k),int(b))
elif a+b<k:
    print(0,0)
else:
    print(0,int(a+b-k))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()
b = input()
print(b+a)

Submission status: Runtime Error

Solution code:
A, B, K = map(int, input().split())
if K <= A:
  print(*[A-K, B])
elif K <= A + B:
  print(*[0, B-(K-A)])
else:
  print(*[0, 0])

Submission status: Runtime Error

Solution code:
the_string = raw_input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100):
    S = S.lower()
    T = T.lower()
    print(S+T)

Submission status: Runtime Error

Solution code:
A,B,K = [int(i) for i in input().split()]
a = A - (K - (K -A))
b = B - (K - A)
print(f"{a} {b}")

Submission status: Runtime Error

Solution code:
s=input()
s=input()+s
ptint(s)

Submission status: Runtime Error

Solution code:
def solve():
    A, B, K = map(int, input().split())
    if K <= A:
        print(A-K, B)
    elif A+B <= K:
        print(0, 0)
    else:
        print(0, B-(K-A))


if __name__ == '__main__':
    solve()

Submission status: Runtime Error

Solution code:
S = input()
T = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
if a<k:
	b=max(b-(k-a),0)
	a=0
else:
	a=a-k
print(a,end=' ')
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

C = int(K)-int(A)
B = int(B)-C

print(str(C) +" "+ str(B))

Submission status: Runtime Error

Solution code:
S = input().split()
 
print(sum(S))

Submission status: Runtime Error

Solution code:
n = input()
m = input()
a = m+n
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = str(input())
b = str(input())
c = (b + a)
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(t+s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
S = input()
T = input()
# 出力
print("{}".format(S + T))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<stdio.h>
int main() {
	char s[100], t[100];
	scanf("%s %s", s,t);
	for (int i = 0; i != '\0'; i++) {
		printf("%c", t[i]);
	}
	for (int j = 0; j != '\0'; j++) {
		printf("%c", s[j]);
	}
	
	return 0;
}

Submission status: Runtime Error

Solution code:
S = input()
T = input()

m = T + S
            
print(m)

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
if a >= k:
  print('{} {}'.format(a-k.b))
elif a+b >= k:
  print('0 {}'.format(b-(k-a)))
else:
  print('0 0')

Submission status: Runtime Error

Solution code:
a = str(input())
b = str(input())
print(a + b)

Submission status: Runtime Error

Solution code:
s = input("Enter S: ")
t = input("Enter T: ")

if len(s) > 100 or len(t) > 100:
    print("Length of the string is not more than 100")
else:
    print("String: "+ t + s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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(f'{t}{s}')

Submission status: Runtime Error

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

puts S + T

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
S = int(input())
T = int(input())
# 出力
print("{}".format(S + T))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
t=input()

print(t+s, sep="")

Submission status: Runtime Error

Solution code:
n = list(map(int, input.split()))

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

print(ans)

Submission status: Runtime Error

Solution code:
print(str(input()) + str(input()))

Submission status: Runtime Error

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