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:
a,b,k=map(int,input().split())
if k>=a:
  A=0
  if k-a>=b:
    B=0
  else:
    B=b-(k-a)
else:
  A=a-k
  B=b
print('{}{}'.format(A,B))

Submission status: Runtime Error

Solution code:
A=input()
B=input()
print(B+A)

Submission status: Runtime Error

Solution code:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a+b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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 - (K - A))
else:
	print(K - A, B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T = input("")
S = input("")
print("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:
    C = K - A
    print(0, B-C)

else:
    print(A - K, B)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
st = str(input())
s, t = st.split('')
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 -= 1 
  elif b > 0:
    b -= 1
  else:
    break
print(str(a) + " " + str(b))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;


int main()
{
    string s, t;
    cin >> s >> t;
    
    cout << t << s << "\n";
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, K = [int(s) for s in input().split()]

if K <= A:
    print(A-K, B)
elif K <= A + B:
    print(0, A+B-K)
else:
    print(0, 0)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
input(S)
input(T)

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

Submission status: Runtime Error

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

print(T + S)

Submission status: Runtime Error

Solution code:
x = int(input())




# 素数を求める
pn = []
for xi in range(2, x+1):
  flag = 1
  for pi in pn:
    if xi%pi==0:
      flag = 0
  if flag == 1:
    pn.append(xi)

#print(pn)

# inputをカウントアップしながら、素数で割れるか確認
while True:
  x += 1
  flag = 1
  for pi in pn:
    if x%pi==0:
      flag = 0
      break
  if flag == 1:
    break

print(x)

Submission status: Runtime Error

Solution code:
n, k = [int(x) for x in input().split(" ")]
s, p, r = [int(x) for x in input().split(" ")]
texts = list(input())

def can_key(i, key):
    if i - k >= 0:
        if last_h[i - k] != key:
            return True
        return False
    return True

score = 0
last_h = []
for i, text in enumerate(texts):
    if text == "r":
        if can_key(i, r):
            score += r
            last_h.append(r)
        else:
            # score += s
            last_h.append(s)

    elif text == "s":
        if can_key(i, s):
            score += s
            last_h.append(s)
        else:
            # score += p
            last_h.append(p)

    elif text == "p":
        if can_key(i, p):
            score += p
            last_h.append(p)
        else:
            # score += r
            last_h.append(r)
print(score)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(T+S)

Submission status: Runtime Error

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

print(str(A) + " " + str(B))

Submission status: Runtime Error

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

if k < a:
  a = a-k

else:
  k = k-a
  a = 0
  if k < b:
    b = b-k
  else:
    b = 0

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(500*500)
S = input()
T =input()
s = S.lower()
t = T.lower()
if len(s) or len(t) > 100 : 
    print("error")
print(T + S)

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(500*500)
S = input()
T =input()
S.lower()
T.lower()
print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
str1, str2 = input().strip()

print("".join((str1,str2)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
    def print_character(str1, str2):
      str outputWord
      outputWord = str1 + str2
      print(outputWord)

Submission status: Runtime Error

Solution code:
def print_character(str1, str2):
  str outputWord
  outputWord = str1 + str2
  return(outputWord)

Submission status: Runtime Error

Solution code:
def isPrime(n):
    if n == 1: return False
 
    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
 
    return True
  
num = input()
 
res = True
ans = 0
if num > 2 and num%2 == 0:
  num += 1
while(res):
  if isPrime(num):
    print(num)
    break
  num += 2

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a, b = input().split()
pirnt("{}{}".format(b,a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input("文字列Sを入力")
T = input("文字列Tを入力")
txt = S + T
print(txt)

Submission status: Runtime Error

Solution code:
x = int(input())
 
for val in range(x, x**1000) :
	if x ==2 :
		print(x)
		break
	elif ((10** (val-1)) % val) == 1 :
		print (val)
		break
	else :
		continue

Submission status: Runtime Error

Solution code:
x = int(input())
 
for val in range(x, x**1000) :
	if x ==2 :
		print(x)
		break
	elif ((10** val) % val) == 10 :
		print (val)
		break
	else :
		continue

Submission status: Runtime Error

Solution code:
x = int(input())
 
for val in range(x, x**100) :
	if x ==2 :
		print(x)
		break
	elif ((10** val) % val) == 10 :
		print (val)
		break
	else :
		continue

Submission status: Runtime Error

Solution code:
x = int(input())
 
for val in range(x+1, x**100) :
	if x ==2 :
		print(x)
		break
	elif ((2** val) % val) == 2 :
		print (val)
		break
	else :
		continue

Submission status: Runtime Error

Solution code:
print("".join(reverse(input("").split(" "))))

Submission status: Runtime Error

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

U = T + S
print(U)

Submission status: Runtime Error

Solution code:
test1 = input()
test2 = input()

ans = test2 + test1

print(ans)

Submission status: Runtime Error

Solution code:
in_list = input().split()
A, B, K = int(in_list[0]), int(in_list[1]), int(in_list[2])

for k in range(K):
  if A > 0:
    A -= 1
  elif B > 0:
    B -= 1
  elif:
    pass

print(A, B)

Submission status: Runtime Error

Solution code:
moji_s=input("文字列Sを入力:")
moji_t=input("文字列Tを入力:")
print(moji_s + moji_t)

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, a+b-k)
else:
    print(a-k,b)

Submission status: Runtime Error

Solution code:
a,b,k = map(int,input().split())
 
for a,b in range(k):
	if a >=  1:
            a -= 1
  
	elif a < 1 and b >= 1:
            b -= 1
	else:
            break
        
print (a,b,end=" ")

Submission status: Runtime Error

Solution code:
a,b,k = map(int,input().split())
 
for a,b in range(k):
	if a >=  1:
        a -= 1
  
	elif a < 1 and b >= 1:
        b -= 1
	else:
        break
        
print (a,b,end=" ")

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
 
for a,b in range(k):
	if a >=  1:
      a -= 1
  
	elif a < 1 and b >= 1:
      b -= 1
	else:
      break
        
print (a,b,end=" ")

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
 
for a,b in range(k):
	if a >=  1:
    	a -= 1
  
	elif a < 1 and b >= 1:
		b -= 1
	else:
      	break
        
print (a,b,end=" ")

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
 
for a,b in range(k):
	if a >=  1:
    	a -= 1
  
	elif a < 1 and b >= 1:
		b -= 1
        
print (a,b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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:
import itertools
N,M = map(int,input().split())
A = sorted(map(int,input().split()))[::-1]

print(sum(sorted([sum(i) for i in itertools.product(A, repeat=2)])[::-1][:M]))

Submission status: Runtime Error

Solution code:
#import numpy as np
#import csv
import sys
#import time

def main():
  argv = sys.argv
  print(argv[2]+argv[1])


if __name__  == "__main__":
  try:
    main() #main
  #error IO Error
  except IOError as error:
    print("No file.")

Submission status: Runtime Error

Solution code:
x = int(input())
flg = 0
_flg = 1
while flg == 0:
    mx  = int(x**0.5)
    for i in range(2, mx+1):
        if x % i == 0:
            _flg = 0
            break
    fig = _flg
    if flg == 0:
        x+=1
print(x)

Submission status: Runtime Error

Solution code:
print(y+x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

prims = list()

prims.append(2)

base = int(input())

def _is_prim(n):
  global prims
  for p in prims:
    if n == p:
      return True
    elif n % p == 0:
      return False
  
  return True

# 入力値の平方根までの素数を作る
base_rt = int(math.sqrt(base))
for n in range(rt):
  if n < 2:
    continue
  elif n % 2 == 0:
    continue
  elif _is_prim(n):
    prims.append(n)

# 作った素数値で。。。
while not _is_prim(base):
  base += 1

print(base)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Q = K - A
q = A - K
if Q < 0 :
  print (q)
if Q >= 0 :
  W = B - Q
  if W >= 0:
    print ("0",W)
  if W< 0 :
    print("0 0")

Submission status: Runtime Error

Solution code:
X = int(input())

while True:
    
    flag = 0
    
    for i in range(2, X+1): #2からXまでのループ
        if (X+1) % i == 0: #対象はX+1という数
            flag = 1
            break
    if flag == 1:
        X += 1
        continue
    break
    
print(X + 1)

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
point=0
l=[]
point_list=[r,s,p]
kind=['r','s','p','r']
for i in range(n):
  for j in range(len(kind)-1):
    if t[i]==kind[j]:
      if i-k>=0 and t[i]==kind[l[i-k]+1]:
        if i+k<n and t[i+k]==kind[j+1]:
          if j==2:j=-1
          l.append(j+1)
        else:
          l.append(j)
      else:
        point+=point_list[j-1]
        if j==0:j=3
        l.append(j-1)
      break
print(point)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, k = int(i) for i in input().split()
takahashi = a - k
aoki = b + takahashi if takahashi < 0 else b
print(f"{max(takahashi, 0)} {max(aoki, 0)}")

Submission status: Runtime Error

Solution code:
print(S + T)

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    S = input()
    T = input()
    print(T+S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
##149
##A
S = input()
T = input()

print(T+S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

S, T = input().split(" ")
S = int(S)
T = int(T)
TS = T+S

print("{}".format(TS))

Submission status: Runtime Error

Solution code:
import math
 
def main():
  N = int(input())
  
  print(search(N))
 
def search(x):
  
  ints = list(range(2,x))
  
  # 順に確認する
  for i in ints:
    if x%i==0:
      seartch(x+1)
  	elif x < i**2:
      break
    
  return x

Submission status: Runtime Error

Solution code:
import math
 
def main():
  N = int(input())
  
  if N==2:
    print(2)
  else:
    print(search(N))
 
# xは奇数を前提
def search(x):
  
  # 2は確認不要
  ints = list(range(3,x))
  
  # 順に確認する
  for i in ints:
    
    
    if x%i==0:
      seartch(x+2)
  	elif x < i**2:
      break
    
  return x

main()

Submission status: Runtime Error

Solution code:
import math

def is_prime(x):
  if x <= 1:
    return False
  max_judge = math.sqrt(x)
  count = 2
  while(count < max_judge):
    if x % count == 0:
      return False
    count+=1
  return True
 
x = int(input())
 
judge_prime = False

while(True):
  if is_prime(x):
    break
  x+=1

print(x)

Submission status: Runtime Error

Solution code:
class CookieCalc:
  def __init__(self, t_cookie, a_cookie):
    self.takahashi_cookie = t_cookie
    self.aoki_cookie = a_cookie
    
  def eat_cookie(self):
    if self.takahashi_cookie > 0:
      self.takahashi_cookie-=1
    elif self.aoki_cookie > 0:
      self.aoki_cookie -= 1
      
  def sum_cookie(self):
    return self.takahashi_cookie + self.aoki_cookie
      
t_cookie,a_cookie,K = [int(s) for s in input().split()]
cookie = CookieCalc(t_cookie, a_cookie)
 
for i in range(K):
  cookie.eat_cookie()
  if cookie.sum_cookie() == 0:
    break
    
  
print(cookie.takahashi_cookie, cookie.aoki_cookie)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
# INPUT
input = list(map(int, input().split()))

s = input[0]
t = input[1]

ans = t
print(t+s)

Submission status: Runtime Error

Solution code:
A,B,K = input().split()
x=0
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:
S,T = map(String, input().split())
print('{}{}'.format(T, S))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())-1
result = False

while not result:
  result = True
  X += 1
  for i in range(2,X//2+1):
    if X % i == 0:
      result = False
      break
print(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
strings = list(stdin.readline().split())
print(string[1] + string[0])

Submission status: Runtime Error

Solution code:
nn=int(input())
n=10**5+100
ar=[0]*(n)
ar[1]=0
ans=0
pre=1
for i in range(2,int((n**0.5))+1):
    if ar[i]==0:

        for j in range(2*i,n,i):
            ar[j]=1
ans=1
if ar[nn]==0:
    print(nn)
else:
        
    for i in range(nn,n):
        if ar[i]==0:
            print(i)
            break

Submission status: Runtime Error

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

print(S+T)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
from itertools import accumulate
from bisect import bisect_left

def solve(N: int, M: int, A: "List[int]"):
    A.sort()

    right = 2*A[-1]+1
    left = 0

    while right - left > 1:
        mid = (left+right)//2

        # A[i]+A[j] >= midになるようなi,jの組み合わせの個数 mを 求めたい
        # m >= Mならok
        m = 0
        for i in range(N):
            a = A[i]
            res = mid - a
            # Aからres以上のものを探す
            index = bisect_left(A,res)
            m += N-index
        
        if m >= M:
            left = mid
        else:
            right = mid

    # M通り以上の握手ができる最小の組み合わせの幸福度
    B = sorted(A,reverse=True)
    accum_B = list(accumulate(B))
    answer = 0
    handshake_count = 0
    for i in range(N):
        res = left - A[i]
        if res > A[-1]:
            continue
        index = bisect_left(A,res)
        answer += (N-index)*A[i]+accum_B[N-index-1]
        handshake_count += (N-index)

    # 握手の回数がmを越えたときはその分の幸福度を引く
    if handshake_count>M:
        answer -= left*(handshake_count-M)
    print(answer)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, M, A)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a = str(S)
b = str(T)

print(a+b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import ceil
x=int(input())
i=0
if x<=2:
  print(2)
elif x==3:
  print(3)
elif x==4:
  print(5)
else:
  while 1:
    ok=True
    n=ceil((x+i)**0.5)
    for j in range(2,n):
      if (x+i)%j==0:
        ok=False
        break
    if ok:
      print(x+i)
      exit()
    i+=1

Submission status: Runtime Error

Solution code:
def main():
  [n, k] = [int(i) for i in input().split()]
  [r, s, p] = [int(i) for i in input().split()]
  T =  input()
  
  my = T.replace("r", "hoge").replace("s", "r").replace("p", "s").replace("hoge", "p") 
  for i in range(k, n):
    if my[i] == my[i-k]:
      my = my[:i] + "l" + my[i+1:]  
      
  print(my.count("r")* r + my.count("s")*s + my.count("p")* p)
  
if __name__ == "__main__":
  main()

Submission status: Runtime Error

Solution code:
T + S

Submission status: Runtime Error

Solution code:
L,R = input().split()
print R + L

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print (sys.argv[2]+ sys.argv[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(S+T)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=str(input())
for i in range(len(s)):
  if s[i]==" ":
    s[i]=""
print[s]

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import sqrt
X = int(input())
def is_prime_next(X):
    X_sqrt = int((sqrt(X)-5)/6) 
    if X==2 or X==3:
        return X
    if X%2 == 0:
        return None
    if X%3 == 0:
        return None
    for i in range(1, X_sqrt):
        if X % (6*i+1) == 0 or X % (6*i+5) == 0:
            return None
    return X
while(1):
    X_keep = is_prime_next(X)
    if X_keep != None:
        break
    X += 1
print(X)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
print('',join(input().split()))

Submission status: Runtime Error

Solution code:
import argparse

def make_parser():
    parser = argparse.ArgumentParser()

    parser.add_argument('S')
    parser.add_argument('T')

    args = parser.parse_args()

    return args

def main():
    args = make_parser()
    T = args.T
    S = args.S

    print(T + S)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
def f(S,t):
    return T+S
S=input()
T=input()
print(f(S,T))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
taka, aoki, action = map(int, input().split())
 
if taka >= action:
  print(taka-action, aoki)
  
else:
  print(0, max(taka+aoki-action, 0))

Submission status: Runtime Error

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

print(t+s)

Submission status: Runtime Error

Solution code:
import sys
import math
import heapq
import bisect

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

N,M=LI()
As=LI()
As.sort()
len_As = len(As)
Acum=[As[0]]
for i in range(1, len_As):
    Acum.append(Acum[i-1]+As[i])
# print(As)
# print(Acum)

ok = 0
ng = 2*max(As)+1

pat = 0
sm = 0
while ng - ok > 1:
    mid_sum = (ok + ng)//2
    pat = 0
    sm = 0
    for A in As:
        A2 = mid_sum - A
        # print(A2)
        lft = bisect.bisect_left(As, A2)
        pat += len_As - lft
        sm += Acum[len_As-1] - (lft and Acum[lft-1]) + (len_As - lft)*A
    # print(pat, M, ok, ng)

    if pat < M: ng = mid_sum
    else: ok = mid_sum

pat = 0
sm = 0
for A in As:
    A2 = ok - A
    # print(A2)
    lft = bisect.bisect_left(As, A2)
    pat += len_As - lft
    sm += Acum[len_As-1] - (lft and Acum[lft-1]) + (len_As - lft)*A

# print("lo:{} hi:{} pat:{} sum:{}".format(ok, ng, pat, sm))

print(sm - (pat-M)*ok)

Submission status: Runtime Error

Solution code:
import argparse

def make_parser():
    parser = argparse.ArgumentParser

    parser.add_argument('S')
    parser.add_argument('T')

    args = parser.parse_args()

    return args

def main():
    args = make_parser()
	T = arg.T
    S = arg.S
    
    printf(S + T)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def MaxScore(n,t):
    SC = 0
    if t[0]=='r':
        SC+=P
    elif t[0]=='s':
        SC+=R
    else:
        SC+=S
    NC=1
    for i in range(1,n):
        if t[i]=='r':
            if t[i]!=t[i-1]:
                SC+=P
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=P
                NC+=1
            else:
                NC+=1
        elif t[i]=='s':
            if t[i]!=t[i-1]:
                SC+=R
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=R
                NC+=1
            else:
                NC+=1
        else:
            if t[i]!=t[i-1]:
                SC+=S
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=S
                NC+=1
            else:
                NC+=1
    return SC

for i in range(K):
    Ti=[T[j] for j in range(N) if j%K==i]
    Ti=''.join(Ti)
    if (N-i)%K==0:
        Ni=(N-i)//K
    else:
        Ni=(N-i)//K+1
    SCi=MaxScore(Ni,Ti)
    SC+=SCi
    
print(SC)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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=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:
x = input()
y = input()

print(y+x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input s, t
return t + s

Submission status: Runtime Error

Solution code:
<?php
# Input
fscanf(STDIN, "%s %s", $s, $t);
# 出力
echo $t.$s."\n";
?>

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 A>=K:
    print(A-K, B)
else:
    print(0, max(0, B-(K-A)))

Submission status: Runtime Error

Solution code:

N, K = map(int, input().strip().split(" "))
R, S, P = map(int, input().strip().split(" "))
T = list(input())

point = {
    "r": P,
    "s": R,
    "p": S
}

score = 0

for i in range(N):

    tmp = i - K
    if 0 <= tmp and T[i] == T[tmp]:
        score += 0
        T[i]=""

    else:
        score+= point[T[i]]
print(score)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
t,s=map(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:
x, y = map(int,input().split())
print(y+x)

Submission status: Runtime Error

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

if (a + b) <= n:
  a = 0
  b = 0
else:
  if n > a:
    b -= n-a
    a = 0
    if b < 0:
      b = 0
  else:
    a = (n-a)

print("%d %d" %(a,b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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