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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline



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

Submission status: Accepted

Solution code:
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())

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a,b=input().split()
print(b+a)

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n = int(input())
# a,b = map(int,input().split())
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("{}{}".format(T,S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

t += s
print(t)





 
#           -------     - -
#           -     -      -    - 
#           -    -         -
#           ------
#           -
#           -

Submission status: Accepted

Solution code:
import sys

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

def main():
    return t + s

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
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()

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
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()) #整数map取得
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/12/29

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(t, s, sep="")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s,t=map(str,input().split())
print(t+s)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    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): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    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)

Submission status: Accepted

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

Submission status: Accepted

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

print(t,end='')
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:
#A
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:

S,T = input().split()

print (T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC149a


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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
# MOD = 998244353



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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, k = [int(i) for i in input().split()]
r, s, p = [int(i) for i in input().split()]
t = list(input())
ans = 0
dic = {'p': s, 's': r, 'r': p}
for i in range(k):
  ans += dic[t[i]]
dic_ls = []
for i in range(k, n):
  if t[i] != t[i - k]:
    ans += dic[t[i]]
  else:
    t[i] = 'j'
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(f"{T}{S}")

Submission status: Runtime Error

Solution code:
f"{T}{S}"

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if k<=a:
  print(str(a-k)+' '+str(b))
  
else:
  print(str(0)+' '+str(min(0,b-(k-a))))

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
R,S,P=map(int,input().split())
L=input()
T=[]
for i in range(N):
    T.append(L[i])
for i in range(K,N):
    if T[i]==T[i-K]:
        T[i]="0"
p=0
for i in T:
    if i=="r":
        p+=P
    elif i=="s":
        p+=R
    elif i=="p":
        p+=S
print(p)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if a==1:
    print("Alice")
elif b==1:
    print("Bob")
elif a>b:
    print("Alice")
elif a<b:
    print("Bob")
elif a==b:
    print("Draw")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
main = do
    [s, t] <- words <$> getLine
    putStrLn $ t ++ s

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(T+S)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
using namespace std;
int main()
{
    string s, t;
    cin >> s >> t;
    cout << t+s;
}

Submission status: Runtime Error

Solution code:
N,M=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
l=[]
for b in a:
    for c in a:
        l.append(b + c)
print(sum(sorted(l)[len(l)-M:]))

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

Submission status: Runtime Error

Solution code:
S=input()
T=input()
print("T"+"S")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,k =  input().split()
a = int(a)
b = int(b)
k = int(k)
if a <= k:
    i = 0
    m = b - (k-a)
else:
    i = a-k
    m=b
print(i,m)

Submission status: Runtime Error

Solution code:
n,m=list(map(input().split()))
print(m.append(n))

Submission status: Runtime Error

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

x = t + s
print(x)

Submission status: Runtime Error

Solution code:
X=int(input())
if x==2:
  print(2)
else:
  for i in range(X,10**6):
    for j in range(2,i):
      if i%j==0:
        break
      if j==i-1:
        print(i)
        exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def miller_rabin(n, k=100):
    import random
    if n == 2:
        return True
    if n == 1 or n & 1 == 0:
        return False
    d = (n - 1) >> 1
    while d & 1 == 0:
        d >>= 1
    for _ in range(k):
        a = random.randint(1, n - 1)
        t = d
        y = pow(a, t, n)
        while t != n - 1 and y != 1 and y != n - 1:
            y = (y * y) % n
            t <<= 1
        if y != n - 1 and t & 1 == 0:
            return False
    return True
def main():
  x=int(input())
  for i in range(x,1000000):
    if miller_rabin(i):
      print(i)
      return
main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(t + s)

Submission status: Runtime Error

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

print(t + s)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())

ans=abs(abs(x)-abs(y))

if x<0 and y<=0 or x>=0 and y>0:
  if x>y:
    ans+=2

else:
  ans+=1
  
print(ans)

Submission status: Runtime Error

Solution code:
print(S,T)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
n=input()
print(ns)

Submission status: Runtime Error

Solution code:
import heapq

n,m = map(int, raw_input().split(' '))
elems = map(int, raw_input().split(' '))
elems.sort()

heap = [(-elems[i] - elems[-1], i,len(elems) - 1) for i in range(len(elems))]
heapq.heapify(heap)
cumul = 0

while(m):
	m -=1
	v, i, j = heapq.heappop(heap)
	cumul -= v
	if j -1 >=0: heapq.heappush(heap, (-elems[i] - elems[j-1], i, j - 1))
print cumul

Submission status: Runtime Error

Solution code:
A - Strings

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ST = list(map(str, inpuy().split()))

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

Submission status: Runtime Error

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



X=int(input())

prime_l=[0]*(2*X)
for  i in range(2,X):
    if(prime_l[i]==0):
        for j in range(1,(2*X)//i):
            prime_l[i*j]+=1
        
while(1):
    X+=1
    if(prime_l[X]==0):
        print(X)
        sys.exit(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(t+s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# S,T = input().split()
A,B,K = map(int, input().split())
# A = int(input())
# B = int(input())
# C = int(input())
# s= input()
if A >= K:
    print(A - K,B)
elif A + B >=K:
    print(0,A + B - K)
else:
    print(0,0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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, gcd
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions 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: Runtime Error

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

Submission status: Runtime Error

Solution code:
In = list(map(int, input().split()))
sin = set(In)
print("Yes" if len(sin) == 2 else "No")

Submission status: Runtime Error

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

print(T,S)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
print(max(0,a-k),max(0,b-max(0, k-a)))

Submission status: Runtime Error

Solution code:
x = int(input())
cnt = 0
while True:
  for i in range(1,x+1):
    if x % i == 0:
      cnt += 1
  if cnt == 2:
    print(x)
    break
  else:
    x += 1

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
/*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for(int V = S; V < E; V++)
#define ford(V, S, E) for(int V = S; V >= E; V--)
#define fore(E, X) for(auto &E:X)
#define println(X) cout << X << endl
#define printe(X) for(auto &E:X) cout << E << " "; cout << endl
typedef unordered_map<int, unordered_set<int>> graph;
typedef long long ll;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	string s, t; cin >> s >> t;
	println(t+s);
}

Submission status: Runtime Error

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

def resolve():
    x=int(input())
    ans=x
    while True:
        flag=False
        for i in range(2,int(x**0.5)):
            if ans%i==0:
                flag=True
                break
        if flag:
            ans+=1
            continue
        else:
            break
    print(ans)
resolve()

Submission status: Runtime Error

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

    print(T + S )

Submission status: Runtime Error

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n,k=map(int,input().split())
    r,s,p=map(int,input().split())
    T=input()
    T_lis=[False]*n
    ans=0
    for i,t in enumerate(T):
        if i-k>=0:
            if T[i-k]==t and T_lis[i-k]:
                continue
        if t=='r':
            ans+=p
        elif t=='s':
            ans+=r
        else:
            ans+=s
        T_lis[i]=True
    print(ans)


if __name__=='__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(T,S,sep="")

Submission status: Runtime Error

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

print(T + S)

Submission status: Runtime Error

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

print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import deque

S = str(input())
T = str(input())

print(T, S, sep='')

Submission status: Runtime Error

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

x = str(t) + str(s)

print(x)

Submission status: Runtime Error

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

x = t+s

print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
if a >= k:
    a -= k
elif a < k and a + b >= k:
    b = b - (k-a)
    a = 0
else:
    a = 0
    b = 0
print(a, b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, K = map(int, input().split())
print(max(0, A - K), max(0, min(A + B -K, B)))

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
if k <= a:
    a1 = a - k
    b1 = b
elif a < k and k < a + b:
    a1 = 0
    b1 = b - (k-a)
else:
    a1 = 0
    b1 = 0

print(a1, b1)

Submission status: Runtime Error

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

W,F= input().split()
a = stringcc(FW)
print(a)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s=input()
t=input()
print(t+s)
#a comment for exec

Submission status: Runtime Error

Solution code:
for mn in range(n):
    a=input()# String1 in the pair
    b=input()#String2 in the pair
    la=[]
    lb=[]

    for i in range(max(len(a),len(b))):#creating lists with all possible elements by slicing off the characters
        la.append(a[i:])
        lb.append(b[i:])

    if len(a)>len(b):#removes empty elements
        lb=[x for x in lb if x!='']
    else:
        la=[x for x in la if x!='']

    while True:#Create empty list for sorting the 0th elements of 'la' nd 'lb'
        temp=[]
        temp.append(la[0])
        temp.append(lb[0])
        temp=sorted(temp)
        print(temp[0][0],end='')#print the 1st character

        if(temp[0] in la):#removing the element after printing the first character
            la.pop(0)
        else:
            lb.pop(0)

        if len(la)==0:#breaks the while loop if a list gets empty
            print(temp[1],end='')
            break
        elif len(lb)==0:
            print(temp[1],end='')
            break

Submission status: Runtime Error

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