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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
str_l = sorted(list(map(str, input().split())))
print(''.join(str_l))

Submission status: Wrong Answer

Solution code:
str_l = list(map(str, input().split()))
print(''.join(str_l))

Submission status: Wrong Answer

Solution code:
import sys

S, T = next(sys.stdin).strip().split()
print(T, S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal
from argparse import ArgumentParser

args=ArgumentParser()
args.add_argument('-loc', '--local', type=bool,default=False)
LOCAL=args.parse_args().local

def input(): 
    x=sys.stdin.readline(); 
    if x[-1]=="\n": 
        return x.rstrip() 
    return x
    
def printe(*x):_=print("## ",*x,file=sys.stderr) if LOCAL else 0
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    a,b = input().split()
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    l=[a,b]
    l.sort()
    print(l[0]+l[1])



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(a+b, sep = "")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print("".join(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input().strip())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S='oder'
T='atc'
print(S+T)

Submission status: Wrong Answer

Solution code:
S='oder'
T='atc' 
print(T+S)

Submission status: Wrong Answer

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

print(S + T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input().split())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def func(S, T):
    ans = ''
    for s, t in zip(S, T):
        ans += (t + s)
    return ans
 
 
if __name__ == "__main__":
    S, T = input().split()
    print(func(S, T))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# A - Strings

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(T,S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

list = [s, t]
list.sort()
print(list[0]+list[1])

Submission status: Wrong Answer

Solution code:
s , t = map(str, input().strip().split())
if s[0]>=t[0]:
    print(t+s)
else:
    print(s+t)

Submission status: Wrong Answer

Solution code:
s , t = map(str, input().strip().split())
if s[0]>t[0]:
    print(t+s)
else:
    print(s+t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print("%s%s" %(s,t))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def fun(S,T):
     print(T+S)
S="humu"
T="humu"
fun(S,T)

Submission status: Wrong Answer

Solution code:
def func(S,T):
     print(T+S)

S="force"
T="coding"
func(S,T)

Submission status: Wrong Answer

Solution code:
def func(ab,bc):
     print(bc+ab)

ab="force"
cd="coding"
func(ab,cd)

Submission status: Wrong Answer

Solution code:
def newString(s, k): 
      
    # new string 
    X = "" 
  
    # Remove characters until 
    # the string is empty 
    while (len(s) > 0): 
        temp = s[0] 
  
        # Traverse to find the smallest  
        # character in the first k characters 
        i = 1
        while(i < k and i < len(s)): 
            if (s[i] < temp): 
                temp = s[i] 
  
            i += 1
          
        # append the smallest character 
        X = X + temp 
  
        # removing the lexicographically  
        # smallest character from the string 
        for i in range(k): 
            if (s[i] == temp): 
                s = s[0:i] + s[i + 1:] 
                break
          
    return X 
  
# Driver Code 
if __name__ == '__main__': 
    s = "gaurang"
    k = 3
    print(newString(s, k))

Submission status: Wrong Answer

Solution code:
def chars_mix_up(a, b):
  new_a = b[:2] + a[2:]
  new_b = a[:2] + b[2:]

  return new_a + ' ' + new_b
print(chars_mix_up('abc', 'xyz'))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(s+t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Submission status: Wrong Answer

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

answer  = S + T

print(answer)

Submission status: Wrong Answer

Solution code:
print(input().rstrip(" "))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
S, T = stdin.readline().rstrip().split()

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

INF = float('inf')


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(*list(input().split()),sep="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = S + T

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a.sort()


print(''.join(a))

Submission status: Wrong Answer

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

sort_a = sorted(a)

print(''.join(sort_a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input().strip())
#strip空白を消す

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(''.join(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = S + T

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
S, T = input().split()

U = S+T
print(U)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(s + t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(s + t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
ans = ''.join([str(x) for x in input().split()])
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = list(str(x) for x in input().split())
print(''.join(l))

Submission status: Wrong Answer

Solution code:
l = list(x for x in input().split())
print(''.join(l))

Submission status: Wrong Answer

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

A = S+T

print(A)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(S + T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a+b)

Submission status: Wrong Answer

Solution code:
import sys
from io import StringIO
import unittest


def resolve() :
    a = input().split()

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

Submission status: Wrong Answer

Solution code:
string = str(input().split())
print(string)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(T + S)

Submission status: Wrong Answer

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

s,t = input().split()

print(s+t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

O = "".join(S)

print(O)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if X>Y:
    print(Y+X)
else:
    print(X+Y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input().split()
print("{}{}".format(s[0],s[1]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def main():
    N = map(int, open(0).read().split())


main()

Submission status: Wrong Answer

Solution code:
order = 0
a, b = input().split()
idx_a, idx_b = 0, 0

while order == 0 and idx_a < len(a) and idx_b < len(b):
  la, lb = a[idx_a], b[idx_b]
  
  if la < lb:
    order = -1
  elif lb < la:
    order = 1
  
  idx_a += 1
  idx_b += 1

if order == 0 or order == -1:
  print(a+b)
else:
  print(b+a)

Submission status: Wrong Answer

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

print(a+b)

Submission status: Wrong Answer

Solution code:
a, b = input().split()
 
if a[0] < b[0]:
  print(a+b)
else:
  print(b+a)

Submission status: Wrong Answer

Solution code:
a, b = input().split()
 
if a[0] < b[0]:
  print(a+b)
else:
  print(b+a)

Submission status: Wrong Answer

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

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from itertools import accumulate

a = list(range(1, 11))
b = list(accumulate(a))     # itertoolsの戻り値はイテレータとなっているので必要に応じてlist化します．
print(a)
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("hanhanahanahnahanahananaaananan")

Submission status: Wrong Answer

Solution code:
S = str("oder")
T = str("atc")

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def rem(string): 
	return string.replace(" ", "") 
	
string = 'asdasd asdad'
print(rem(string))

Submission status: Wrong Answer

Solution code:
def rem(string): 
	return string.replace(" ", "") 
	
string = 'asdasd asdad asdadew'
print(rem(string))

Submission status: Wrong Answer

Solution code:
def string(s, t):
	summ1 = 0
	summ2 = 0
	for i in range(len(s)):
		summ1 += ord(s[i])
	for j in range(len(t)):
		summ2 += ord(t[j])
	if summ1 > summ2:
		print(t, end="")
		print(s)
	else:
		print(s, end="")
		print(t)


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


ans = S + T

print(ans)

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 8, Jan, 2020
problem : ABC149

"""

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

S, T = read().split()
answer = T+S
print(answer)

Submission status: Wrong Answer

Solution code:
S = 'oder'
T = 'atc'
H=T+S
print(H)

Submission status: Wrong Answer

Solution code:
S='shi'
T='su'
sushi = T+S
print(sushi)

Submission status: Wrong Answer

Solution code:
S = 'shi'
T = 'su'
print(T+S)

Submission status: Wrong Answer

Solution code:
S = 'shi'
T = 'Su'
print(T+S)

Submission status: Wrong Answer

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

answer = leet[0] + leet[1]
print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print('T'+'S')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def conc(s, t):
  return t[:2] + t[2:] + s

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jan  4 16:21:16 2020

@author: masat
"""

S, T = input().split()

print(S+T)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lst = [x for x in input().split()]
print("".join(lst))

Submission status: Wrong Answer

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

print('{} {}'.format(a[1],a[0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(S+T)

Submission status: Wrong Answer

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

print(b, a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inputValue = input()

output = ''.join(inputValue.split())

print(output)

Submission status: Wrong Answer

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

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(str,input().split())
if a[0]>b[0]:
    print(b+a)
else:
    
    print(a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
'''
import math
import fractions

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

    # divisors.sort()
    return divisors

def bitlist(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res
'''
#a = list(map(int, input().split()))
'''
n,m,t = list(map(int, input().split()))

nb = [[] for i in range(n+1)]
for i in range(n):
    a,b = list(map(int, input().split()))
    nb[a].append([b,i])
    nb[b].append([a,i])
print(nb)

order = [-1 for i in range(n+1)]
order[1] = 0
noworder = 1
nbnow = [len(nb[i])-1 for i in range(n+1)]

print(nbnow)
queue = [[1,999999]]
deque = 0

while(len(queue)>deque and len(queue)<20):
    nownum = queue[deque][0]
    nowpos = queue[deque][1]
    deque+=1
    print("a",nownum,nowpos)
    while(True):
        if(nb[nownum][nbnow[nownum]][1] > nowpos):
            nbnow[nownum] -= 1
        if(nbnow[nownum]<=-1):
            break
    if(nbnow[nownum]<=-1):
        continue
    
    nextnum = nb[nownum][nbnow[nownum]][0]
    nextpos = nb[nownum][nbnow[nownum]][1]
    print(nextnum,nextpos)
    if(order[nextnum]==-1):
        queue.append([nextnum,nextpos])
        order[nextnum]=noworder
        noworder+=1


print(order)
'''

#a = list(map(str, input().split()))

a = list(map(str,input().split()))

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

Submission status: Wrong Answer

Solution code:
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

def debug(*var, sep = ' ', end = '\n'):
    print(*var, file=sys.stderr, end = end, sep = sep)

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
# from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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

Submission status: Wrong Answer

Solution code:
def main():
  def stringConcat(s,t):
    return t+s
  
print(main())

Submission status: Wrong Answer

Solution code:
def concStrings(s, t):
  return t+s

Submission status: Wrong Answer

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