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:
String : ")
str2 = input("Please Enter the Second String : ")

concat1 = str1 + str2
print("The Final String After Python String Concatenation = ", concat1)

concat2 = str1 + ' ' + str2
print("The Final After String Concatenation with Space = ", concat2)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

print(s+t)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

A,B,K = [int(i) for i in input().split(" ")]

def check(A,B,K):
    if 0 < K < A:
        A-=K
        K = 0
    else:
        result = K-A
        A = 0
        K = result
    if 0 < B:
        if K < B:
            B-=K
        else:
            B = 0
    return "{0} {1}".format(A,B)

print(check(A,B,K))

Submission status: Runtime Error

Solution code:

A,B,K = [int(i) for i in input().split(" ")]

def check(A,B,K):
    if A > K:
        A=-K
    else:
        result = K-A
        A = 0
        K = result
    B-=K
    return "{0} {1}".format(A,B)

print(check(A,B,K))

Submission status: Runtime Error

Solution code:
import sys

def f(x):
    p=0
    cnt=0
    for i in range(n-1,-1,-1):
        while p<n and a[i]+a[p]<x:
            p+=1
        cnt+=n-p
    return cnt

n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()

l,r=a[0]*2,a[n-1]*2

while r-l>0:
    if r-l<=1:
        if f(r)==m: md=r;break 
        else: md=l;break
    md=(r+l)//2
    k=f(md)
    if k==m: break
    elif k>m: l=md
    else: r=md

p=0
cnt=0
ans=0

for q in range(n-1,-1,-1):
    try:
        while (p<n and a[q]+a[p]<=md):
            p+=1
    except:
        p=n

    if p==n: break
    cnt+=n-p
    ans+=a[q]*(n-p)*2


ans+=(m-cnt)*md
print(ans)

Submission status: Runtime Error

Solution code:
import sys

def f(x):
    p=0
    cnt=0
    for i in range(n-1,-1,-1):
        while p<n and a[i]+a[p]<x:
            p+=1
        cnt+=n-p
    return cnt

n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()

l,r=a[0]*2,a[n-1]*2

while r-l>0:
    if r-l<=1:
        if f(r)==m: md=r;break 
        else: md=l;break
    md=(r+l)//2
    k=f(md)
    if k==m: break
    elif k>m: l=md
    else: r=md

p=0
cnt=0
ans=0

for q in range(n-1,-1,-1):
    try:
        while p<n and a[q]+a[p]<=md:
            p+=1
    except:
        print(ans)
        sys.exit()

    if p==n: break
    cnt+=n-p
    ans+=a[q]*(n-p)*2


ans+=(m-cnt)*md
print(ans)

Submission status: Runtime Error

Solution code:
import sys

def f(x):
    p=0
    cnt=0
    for i in range(n-1,-1,-1):
        while p<n and a[i]+a[p]<x:
            p+=1
        cnt+=n-p
    return cnt

n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()

l,r=a[0]*2,a[n-1]*2

while r-l>0:
    if r-l<=1:
        if f(r)==m: md=r;break 
        else: md=l;break
    md=(r+l)//2
    k=f(md)
    if k==m: break
    elif k>m: l=md
    else: r=md

p=0
cnt=0
ans=0

for q in range(n-1,-1,-1):
    try:
        while p<n and a[q]+a[p]<=md:
            p+=1
        if p==n: break
        cnt+=n-p
        ans+=a[q]*(n-p)*2
    except:
        print(0)
        sys.exit()


ans+=(m-cnt)*md
print(ans)

Submission status: Runtime Error

Solution code:
import sys

def f(x):
    p=0
    cnt=0
    for i in range(n-1,-1,-1):
        while p<n and a[i]+a[p]<x:
            p+=1
        cnt+=n-p
    return cnt

n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()

l,r=a[0]*2,a[n-1]*2

while r-l>0:
    if r-l<=1:
        if f(r)==m: md=r;break 
        else: md=l;break
    md=(r+l)//2
    k=f(md)
    if k==m: break
    elif k>m: l=md
    else: r=md

p=0
cnt=0
ans=0

try:
    for i in range(n-1,-1,-1):
        while p<n and a[i]+a[p]<=md:
            p+=1
        if p==n: break
        cnt+=n-p
        ans+=a[i]*(n-p)*2
    


except:
    print(0)

ans+=(m-cnt)*md
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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:
import java.io.BufferedReader;
import java.io.*;
import java.util.*;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Collections;
public class Main {
	public static void main(final String[] args){
        Scanner sc = new Scanner(System.in);
        List<Integer> list = new ArrayList<>();
        String s = sc.next();
        String t = sc.next();

        String sum = t.concat(s);
        System.out.println(sum);
    
	}
}

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
if a == 1 and b == 2:
    print(3)
elif a == 2 and b ==3:
    print(1)
else:
    pritn(2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s, t = input().split().rstrip()
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:
ST = input().split()
s += ST[0]
s += ST[1]

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
result = "{:}{:}".format(T, S)

print(result)

Submission status: Runtime Error

Solution code:
result = "{}{}".format(T, S)

print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
"{}{}".fromat(S, T)

Submission status: Runtime Error

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

def EarnScore(rsp, t):
    if t == 'r':
        return rsp[2]
    elif t == 's':
        return rsp[0]
    elif t == 'p':
        return rsp[1]
    else:
        return 0

RSP = [R, S, P]
Answer = 0
ListT = list(T)
for i in range(N):
    Answer = EarnScore(RSP, ListT[i]) + Answer
    if i + K < N:
        if ListT[i] == ListT[i+K]:
            ListT[i+K] = 'x'

print(Answer)

Submission status: Runtime Error

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

def MaxScore(rsp, s):
    Score = 0
    t = list(s)
    t = t + ['t']
    for i in range(len(t)-1):
        if t[i] == t[i+1]:
            t[i+1] = 'x' + t[i+1]
    for i in range(len(t)):
        if t[i] == 'r':
            Score = Score + rsp[2]
        elif t[i] == 's':
            Score = Score + rsp[0]
        elif t[i] == 'p':
            Score = Score + rsp[1]
    return Score

def strsplit(n, t, k):
    tList = [""] * k
    for i in range(n):
        tList[i % k] = tList[i % k] + t[i]
    return tList

RSP = [R, S, P]
Answer = 0
for i in range(K):
    Answer = MaxScore(RSP, strsplit(N, T, K)[i]) + Answer

print(Answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def main():
    n,m=map(int,input().split())
    a=sorted(list(map(int,input().split())))
    a.reverse()
    l,r=2*a[-1],2*a[0]
    x=(l+r)//2
    while l+1<r:
        cnt=0
        for A in a:
            for B in a:
                if A+B>=x:
                    cnt+=1
                else:
                    break
        if cnt>=m:
            l=x
        else:
            r=x
        x=(l+r)//2
    s,cnt=0,0
    for A in a:
        for B in a:
            if A+B>=l:
                cnt+=1
                s+=A+B
            else:
                break
    print(s+(m-cnt)*l)
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

S = input()
T = 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 -= 1
    continue
  
  if  B > 0:
    B -= 1
    continue
  
  else:
    continue
    
    
print(str(A) + " " + str(B))

Submission status: Runtime Error

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

for i in range(K):
  if A > 0:
    A -= 1
    continue
  
  if  B > 0:
    B -= 1
    continue
  
  else:
    continue
    
    
print(A,B)

Submission status: Runtime Error

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

for i in range(K):
  if A > 0:
    A -= 1
    continue
  
  if A ==0 and B > 0:
    B -= 1
    continue
  
  else:
    break
    
print(A,B)

Submission status: Runtime Error

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

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 = input().split()
ptint(T+S)

Submission status: Runtime Error

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

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=.input().split()
print(TS)

Submission status: Runtime Error

Solution code:
S,T =.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 = .input().split()
print(T+S)

Submission status: Runtime Error

Solution code:
A, B, K = [int(i) for i in input().split()]
if K <= A:
    a = A-K
    b = B
elif A < K and K <= A+B:
    a = 0
    b = B-(K-A)
else:
    a = 0
    b = 0
print(a, b)

Submission status: Runtime Error

Solution code:
s, t = map(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 a<k and a+b>k:
    print(0, a+b-k)
else:
    print(0,0)

Submission status: Runtime Error

Solution code:
def connect(a, b):
  return b + a

s = input()
t = input()
print(connect(s, t))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = str(input())
b = str(input())
a,b = b,a
print(a+b)
# a = 2
# b =  1

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:
  print(str(A-K)+" "+str(B))
else:
  t=K-A
 
  print("0"+" "+str(max(B-t,0)))
A,B,K=map(int,input().split())
if A>=K:
  print(str(A-K)+" "+str(B))
else:
  t=K-A
 
  print("0"+" "+str(max(B-t,"0")))

Submission status: Runtime Error

Solution code:
A,B,K=map(int,input().split())
if A>=K:
  print(str(A-K)+" "+str(B))
else:
  t=K-A
 
  print("0"+" "+str(max(B-t,"0")))

Submission status: Runtime Error

Solution code:
import heapq
N, M = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
comb_list = [ i+j for i in A for j in A]
print(sum(heapq.nlargest(M, comb_list)))

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
while true:
  yaruki="ない"

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
for p in range(2, 1000000):
    if n % p != 0:
        print(n)
        break
    else:
       n=n+1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(T + S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
list = [T,S]
	setup.strip','
list

Submission status: Runtime Error

Solution code:
list = []
	print(T,S)
	setup.strip','

list

Submission status: Runtime Error

Solution code:
list = []
	setup.strip','
	print(T,S)
list

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
  import bisect
  import sys
  from itertools import accumulate
  input = sys.stdin.readline
  def hsnum(x):
    num = 0
    for i in a:
      y = x-i
      num += n-bisect.bisect_left(a,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+1 < rx:
    mx = (lx+rx)//2
    if hsnum(mx) < m:
      rx = mx
    elif hsnum(mx) > m:
      lx = mx + 1
    else:
      lx = mx
      break
  if hsnum(lx)>m:
    lx += 1
  error = hsnum(lx)-m
  ans = 0
  for i in a:
    rema = lx - i
    j = bisect.bisect_left(a,rema)
    ans += (n-j)*i-suma[j]
  ans += suma[n]*n
  print(ans-error*lx)
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
def main():
  import bisect
  import sys
  from itertools import accumulate
  input = sys.stdin.readline
  def hsnum(x):
    num = 0
    for i in a:
      y = x-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(mx) < m:
      rx = mx
    elif hsnum(mx) > m:
      if hsnum(mx+1) < m:
        error = hsnum(mx)-m
        lx = mx
        break
      lx = mx + 1
    else:
      lx = mx
      break
  ans = 0
  for i in a:
    rema = lx - i
    j = bisect.bisect_left(a,rema)
    ans += (n-j)*i+suma[n]-suma[j]
  print(ans-error*lx)
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
def main():
  import bisect
  import sys
  from itertools import accumulate
  input = sys.stdin.readline
  def hsnum(ls,x):
    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) < m:
      rx = mx
    elif hsnum(a,mx) > m:
      if hsnum(a,mx+1) < m:
        error = hsnum(a,mx)-m
        lx = mx
        break
      lx = mx + 1
    else:
      lx = mx
      break
  ans = 0
  for i in a:
    rema = lx - i
    j = bisect.bisect_left(a,rema)
    ans += (n-j)*i+suma[n]-suma[j]
  print(ans-error*lx)
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
def main():
    import bisect
    import sys
    from itertools import accumulate
    input = sys.stdin.readline
    def hsnum(ls,x):
        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) < m:
            rx = mx
        elif hsnum(a,mx) > m:
            if hsnum(a,mx+1) < m:
                error = hsnum(a,mx)-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)
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
input = S
input = T
a = list[S,T]:
  print(a)

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(a+b-k))

elif (a + b) < k:
    print('0 0')

Submission status: Runtime Error

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

print(t+s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if K>=A + B:
	print ("0 0")
elif K>=A:
	print (str(0) + ' ' + str(B-(K-A)))
else:
  	print (str(A-K) + ' ' +str(B))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

input_from = input()
info = input_from.split(' ')
a = int(info[0])

def is_prime(n):
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for num in range(3, int(math.sqrt(n)), 2):
        if n % num == 0:
            return False
    return True

if a == 2:
    print(2)
else:
    while not is_prime(a):
        a += 1

print("{0}".format(a))

Submission status: Runtime Error

Solution code:
input_from = input()
strings = input_from.split(' ')
print(f'{strings[1]}{strings[0]}')

Submission status: Runtime Error

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

a = 0
b = 0

if A <= 10**12 and B <=10**12 and K <= 10**12:
    if A >= K :
        a = A-K
    elif  (A + B) >=K:
        a = 0
        b = B-(K-A)
    elif  (A + B)  < K:
        a = 0
        b = 0
else :
    a = 0
    b = 0

print(a,b,end='')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

# FFT
# use python3
# a = np.array([a1,a2,a3]), b= np.array([b1,b2,b3])
# c = np.array([a1b1,a1b2+a2b1,a1a3+a2b2+a3b1,a2b3+a3b2,a3b3])
import numpy as np
def Convolution(a,b):
    bit = (len(a)+len(b)-2).bit_length()
    L = 2**bit
    fa,fb = np.fft.rfft(a,L), np.fft.rfft(b,L)
    c = np.rint(np.fft.irfft(fa*fb,L)).astype(np.int64)
    return c[:len(a)+len(b)-1]

N,M = II()
A = III()

print('time test')

h = [0]*(max(A))
for a in A:
    h[a-1] += 1

conv = np.append([0,0],Convolution(h,h))
ans = 0
count = 0
'''
for k in range(2,2*max(A)+1)[::-1]:
    if conv[k]:
        num = min(M-count,conv[k])
        count += num
        ans += k*num
    if count==M:
        break
'''
print(ans)

Submission status: Runtime Error

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

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

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:
    pass
print("{} {}".format(a,b))

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:
    pass
print("{} {}".format(a,b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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:
a,b,k = map(int,input().split())
if a>=k:
 print(a-k,b)
elif a+b<=k:
 print(0,0)
else:
 print(0,b-k+a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from lib2to3.fixer_util import String
s, t = map(String, input().split())
print(s + t)

Submission status: Runtime Error

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

print("".join([t,s]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
num = int(input())
if num == 2:
    print(2)
    exit()

flag = False
while True:
    for i in range(2, int(num**0.5)+1):
        if num % i ==0:
            flag = False
            break
        else:
            flag = True
    if flag:
        print(num)
        exit()
    else:
        num+=1

Submission status: Runtime Error

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

if A >= K:
  A = A - K
  print(A, B)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(T+S)

Submission status: Runtime Error

Solution code:
a = int(input())
b = list(map(int, input().split()))
s = input()
print("{} {}".format(a+b[0]+b[1], s))

Submission status: Runtime Error

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

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

print(a,b)

Submission status: Runtime Error

Solution code:
print(input().split().replace(" ","")

Submission status: Runtime Error

Solution code:
import numpy as np
 
n,m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
d = 2**18
 
f = np.array([0]*d)
for i in a:
    f[i]+=1
 
tf = np.fft.fft(f)
f = np.fft.ifft(tf*tf)
f = [int(i+0.5) for i in f]
 
ans=0
for i in range(len(f)-1,0,-1):
    if f[i]<=m:
        ans+=i*f[i]
        m-=f[i]
    elif f[i]>m:
        ans+=i*m
        break
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
X =int(input())
 
if X == 2:
    print(X)
 
else:
    s = np.array([2])
    
    for i in range(2, 10**5 + 3):
        res = True
        for j in s:
            if (i % j) == 0:
                res = False
                break
        
        if res == True:
            s = np.append(s, i)
            if i >= X:
                print(i)
                break

Submission status: Runtime Error

Solution code:
inp = input().split(" ")
takahashi = int(inp[0])
aoki = int(inp[1])
K = int(inp[2])

for i in range(K):
    if takahashi > 0 :
        takahashi = takahashi -1
    elif aoki > 0 :
        aoki = aoki-1

print(str(takahashi) + " " + str(aoki))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
dfsfd

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

b = max(0, b - k)

print(a, b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if A == 0:
  print(0, max(0, B - K))
elif B == 0:
  print(max(0, A - K), 0)
elif K == 0:
  print(A, B)

A_from_0 = A
B_from_0 = B

if (A_from_0 - K) >= 0:
  A -= K
  K = 0
else:
  A = 0
  K -= A_from_0
  
if (B_from_0 - K) > 0:
  B -= K
  K = 0
else:
  B = 0
  K -= B_from_0

if K == 0:
  print(A, B)
if K == 1:
  print(0, 1)
elif K > 1:
  print(0, 0)

Submission status: Runtime Error

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

if A == 0:
  print(0, max(0, B - K))
elif B == 0:
  print(max(0, A - K), 0)
elif K == 0:
  print(A, B)

A_from_1 = A - 1
B_from_1 = B - 1

if (A_from_1 - K) >= 0:
  A -= K
  K = 0
else:
  A = 1
  K -= A_from_1
  
if (B_from_1 - K) > 0:
  B -= K
  K = 0
else:
  B = 1
  K -= B_from_1

if K == 0:
  print(A, B)
if K == 1:
  print(0, 1)
elif K > 1:
  print(0, 0)

Submission status: Runtime Error

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

diff = abs(A - B)
a_is_higher = A > B

if K <= diff:
  if a_is_higher:
  	print(A-K, B)
  else:
    print(A, B-K)
else:
  if a_is_higher:
  	A -= diff
  else:
    B -= diff
  K -= diff
  div, mod = divmod(K, 2)
  
  nA = A - div
  nB = B - div
  
  if mod:
    nA -= 1
  
  nA = max(0, nA)
  nB = max(0, nB)
  
  print(nA, nB)

Submission status: Runtime Error

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

diff = abs(A - B)
a_is_higher = A > B

if K <= diff:
  if a_is_higher:
  	print(A-K, B)
  else:
    print(A, B-K)
else:
  if a_is_higher:
  	A -= diff
  else:
    B -= diff
  K -= diff
  div, mod = divmod(K, 2)
  
  nA = Math.max(0, A // 2)
  nB = Math.max(0, B // 2)
  
  if mod:
    print(nA, nB + 1)
  else:
    print(nA, nB)

Submission status: Runtime Error

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

if a[0] < b[0]:
  print(a+b)
else:
  print(b+a)