Problem:


Score : 100 points

Problem Statement

You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.
Print the acronym formed from the uppercased initial letters of the words.

Constraints

s_1, s_2 and s_3 are composed of lowercase English letters.

1 ≤ |s_i| ≤ 10 (1≤i≤3)

Input

Input is given from Standard Input in the following format:

s_1 s_2 s_3

Output

Print the answer.

Sample Input 1

atcoder beginner contest

Sample Output 1

ABC

The initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.

Sample Input 2

resident register number

Sample Output 2

RRN

Sample Input 3

k nearest neighbor

Sample Output 3

KNN

Sample Input 4

async layered coding

Sample Output 4

ALC



Sample input:
atcoder beginner contest


Sample output:
ABC

Submission status: Accepted

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

print(s1[0].upper()+s2[0].upper()+s3[0].upper())

Submission status: Accepted

Solution code:
def main():
    A, B, C = input().split()
    return A[0].upper() + B[0].upper() + C[0].upper()
if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
print(''.join(map(lambda x:x[0],input().split())).upper())

Submission status: Accepted

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

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

print((S[0][0]+S[1][0]+S[2][0]).upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
abc=a[0]+b[0]+c[0]
print(abc.upper())

Submission status: Accepted

Solution code:
sList = list(map(str, input().split()))
string = ""
for i in sList:
    string += i[0]

print(string.upper())

Submission status: Accepted

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():
    s1, s2, s3 = input().split()
    ans = s1[0] + s2[0] + s3[0]
    print(ans.upper())

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#input().split()で受け取ると中身は、x[0]=a,x[1]=b…という形になる
x,y,z=input().split()

#先頭文字をansに格納
ans=x[0]+y[0]+z[0]

#upper関数を用いて大文字化
print(ans.upper())

Submission status: Accepted

Solution code:
a,b,c = input().split(' ')
print(a[0].upper() + b[0].upper() + c[0].upper() )

Submission status: Accepted

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

answer = (a[0] + b[0] + c[0]).upper()
print(answer)

Submission status: Accepted

Solution code:
s, t, u = input().split()
print((s[0] + t[0] + u[0]).upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
ans = (s1[0] + s2[0] + s3[0]).upper()
print(ans)

Submission status: Accepted

Solution code:
a, b, c = (i for i in input().split())
print((a[0]+b[0]+c[0]).upper())

Submission status: Accepted

Solution code:
s = list(input().split())
ans = ""
for i in s:
    ans += chr(ord(i[0])-32)
print(ans)

Submission status: Accepted

Solution code:
s = list(map(str,input().split()))
ans = ""
for i in range(3):
    ans += str.upper(s[i][0])
print(ans)

Submission status: Accepted

Solution code:
# A - Three-letter acronym
s1,s2,s3 = map(str, input().split())

s1 = s1.upper()
s2 = s2.upper()
s3 = s3.upper()
print(s1[0],s2[0],s3[0],sep='')

Submission status: Accepted

Solution code:
a,b,c = input().split()
print(a[0].upper(), b[0].upper(),c[0].upper(),sep="")

Submission status: Accepted

Solution code:
# ABC 59 A

def resolve():
    s1, s2, s3 = input().split()

    tmp = s1[0] + s2[0] + s3[0]

    print(tmp.upper())


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(''.join([s[0].upper() for s in input().strip().split(' ')]))

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(str(a[0].upper())+str(b[0].upper())+str(c[0].upper()))

Submission status: Accepted

Solution code:
A, B, C = map(lambda x: list(x), input().split())
print(str(A[0] + B[0] + C[0]).upper())

Submission status: Accepted

Solution code:
lines = input().split()
print(lines[0][0].upper()+lines[1][0].upper()+lines[2][0].upper())

Submission status: Accepted

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


print((a[0] + b[0] + c[0]).upper())

Submission status: Accepted

Solution code:
a, b, c = input().split()
s = (a[0]+b[0]+c[0]).upper()
print(s)

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
s = s1[0]+s2[0]+s3[0]
print(s.upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().split()
print((n[0][0] + n[1][0] + n[2][0]).upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = input().split()
ans = s1[0] + s2[0] + s3[0]
print(ans.upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
r = (s1[0]+s2[0]+s3[0]).upper()
print(r)

Submission status: Accepted

Solution code:
s = input().split()
upper_diff = ord('A') - ord('a')


def to_upper(c):
    # print("c:", c)
    return chr(ord(c) + upper_diff)


out = "".join(map(to_upper, [x[0] for x in s]))
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(''.join(x[0].upper() for x in input().split()))

Submission status: Accepted

Solution code:
s1,s2,s3 = input().split()
print('{}{}{}'.format(s1[0].upper(),s2[0].upper(),s3[0].upper()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("".join(list(map(lambda x: x[0].upper(), input().split()))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
s1,s2,s3 = map(str,input().split())

X = s1[0] + s2[0] + s3[0]
print(str.upper(X))

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
print(s1[0].upper(), s2[0].upper(), s3[0].upper(), sep='')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(s: "List[str]"):
    print((s[0][0]+s[1][0]+s[2][0]).upper())
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    s = [next(tokens) for _ in range(3)]  # type: "List[str]"
    solve(s)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

s = a[0] + b[0] + c[0]
s = s.upper()
print(s)

Submission status: Accepted

Solution code:
s1, s2, s3 = map(str, input().split())
print(s1[0].upper()+s2[0].upper()+s3[0].upper())

Submission status: Accepted

Solution code:
def main():
    s = input().split()
    
    s1=list(s[0])
    s2=list(s[1])
    s3=list(s[2])
    
    print(str.upper(s1[0])+str.upper(s2[0])+str.upper(s3[0]))
    
main()

Submission status: Accepted

Solution code:
s1,s2,s3=input().split()
print(s1[0].upper(),s2[0].upper(),s3[0].upper(),sep="")

Submission status: Accepted

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

Submission status: Accepted

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

print((a[0] + b[0] + c[0]).upper())

Submission status: Accepted

Solution code:
a,b,c = [s for s in input().split()]

print((a[0]+b[0]+c[0]).upper())

Submission status: Accepted

Solution code:
a,b,c = input().split()
print((a[0]+b[0]+c[0]).upper())

Submission status: Accepted

Solution code:
a , b , c = input().split()
print(a.upper()[0]+b.upper()[0]+c.upper()[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
s = (s1[0] + s2[0] + s3[0]).upper()
print(s)

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
ans = s1[0].upper() + s2[0].upper() + s3[0].upper()
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    s1,s2,s3 = map(str, input().split())
    tmp = s1[0] + s2[0] + s3[0]
    print(tmp.upper())
    
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
abc = list(map(str, input().split()))
abc = [i.upper() for i in abc]
print(abc[0][0] + abc[1][0] + abc[2][0])

Submission status: Accepted

Solution code:
A,B,C = input().split()
print(A.upper()[0]+B.upper()[0]+C.upper()[0])

Submission status: Accepted

Solution code:
a,b,c = input().split()
print( str.upper(a[0]) + str.upper(b[0]) + str.upper(c[0]) )

Submission status: Accepted

Solution code:

a, b, c = input().split()
print(a[0].upper(), b[0].upper(), c[0].upper(), sep='')

Submission status: Accepted

Solution code:
s1, s2, s3=input().split()
ans=s1[0]+s2[0]+s3[0]
print(ans.upper())

Submission status: Accepted

Solution code:
print(''.join(list(map(lambda x: x[0], input().split(' ')))).upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input().upper().split()
print (a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
for a in input().upper().split():print(a[0],end='')

Submission status: Accepted

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

print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
#59

s1, s2, s3 = input().rstrip().split()
print((s1[0]+s2[0]+s3[0]).upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
print( (s1[0]+s2[0]+s3[0]).upper() )

Submission status: Accepted

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

print(('').join([chr(ord(s) - 32) for s in [s1[0], s2[0], s3[0]]]))

Submission status: Accepted

Solution code:
A,B,C = input().split()
print(A[0].upper(), B[0].upper(), C[0].upper(), sep=(''))

Submission status: Accepted

Solution code:
s1,s2,s3 = map(str,input().split())

s = s1[0] + s2[0] + s3[0]

s = s.upper()

print(s)

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
s4 = s1[0] + s2[0] + s3[0]
print(s4.upper())

Submission status: Accepted

Solution code:
s,b,c=input().upper().split()
print(s[0]+b[0]+c[0])

Submission status: Accepted

Solution code:
print(''.join([x[0].upper() for x in input().split()]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input().split()
abc_str = a[0] + b[0] + c[0]
print(abc_str.upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = input().upper().split()
print("{}{}{}".format(a[0],b[0],c[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
S1, S2, S3 = map(str, input().split())

# solve & output
print(S1[0].upper() + S2[0].upper() + S3[0].upper())

Submission status: Accepted

Solution code:
a,b,c = input().split()
ans = a[0].upper()
ans += b[0].upper()
ans += c[0].upper()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s1, s2, s3 = input().split()
    print(str.upper(s1[0] + s2[0] + s3[0]))


main()

Submission status: Accepted

Solution code:
x,y,z = input().split()
print(x[0].upper()+y[0].upper()+z[0].upper())

Submission status: Accepted

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

ans = ""

for i in range(3):
    ans += s[i][0]
    
print(ans.upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
s = a.upper()[0]+b.upper()[0]+c.upper()[0]
print (s)

Submission status: Accepted

Solution code:
a,b,c = input().split()
ans = a[0] + b[0] + c[0]
print(ans.upper())

Submission status: Accepted

Solution code:
words = input().split()
kotae = []
for w in words:
  kotae.append(w[0].upper())
print("".join(kotae))

Submission status: Accepted

Solution code:
x,y,z=input().split()
print((x[0]+y[0]+z[0]).upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
ans = (s1[0]+s2[0]+s3[0]).upper()
print(ans)

Submission status: Accepted

Solution code:
a=input().split()
A,B,C=a[0][0],a[1][0],a[2][0]
ANS=A+B+C
print(ANS.upper())

Submission status: Accepted

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

s = (s1[0] + s2[0] + s3[0]).upper()

print(s)

Submission status: Accepted

Solution code:
s1,s2,s3 = input().split()
print((s1[0] + s2[0] + s3[0]).upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
a,b,c=str.upper(a),str.upper(b),str.upper(c)
print(a[0]+b[0]+c[0])

Submission status: Accepted

Solution code:

def main():
    a, b, c = list(input().split())
    print(a[0].upper() + b[0].upper() + c[0].upper())





if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
letras= list()
lines = sys.stdin.readlines()
for linea in lines:
    c = linea.split()
    c = list(map(str,c))
list(c)
for k in range(len(c)):
  x = c[k]
  a = list(x)
  letras.append(a[0])
b = "".join(letras)
print(b.upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = map(str,input().split())
str1 = list('abcdefghijklmnopqrstuvwxyz')
str2 = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
s1 = str1.index(s1[0])
s2 = str1.index(s2[0])
s3 = str1.index(s3[0])
ans = str(str2[s1]) + str(str2[s2]) + str(str2[s3])
print(ans)

Submission status: Accepted

Solution code:
import sys
s1,s2,s3=map(str,input().split())
inicial=s1[0].upper()+s2[0].upper()
inicial=inicial+s3[0].upper()
print(inicial)

Submission status: Accepted

Solution code:
l='abcdefghijklmnopqrstuvwxyz'
L='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
s=''
t=list(input().split())
for i in range(3):
    for j in range(26):
        if t[i][0]==l[j]:s+=L[j]
        else:pass
print(s)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = input().split()
    a = list(map(lambda x: x.capitalize(), a))
    a,b,c = a
    print(a[0]+b[0]+c[0])
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    s = S()
    for i in range(len(s) - 1):
        if s[i] == s[i+1]:
            print(i + 1, i + 2)
            return
    for i in range(len(s) - 2):
        if s[i] == s[i + 2]:
            print(i + 1, i + 3)
            return
    print(-1, -1)

    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
s1, s2, s3 = map(str, input().split())

ans = s1[0].upper() + s2[0].upper() + s3[0].upper()

print(ans)

Submission status: Accepted

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

s1,s2,s3 = map(str,input().split())
print(s1[0].upper()+s2[0].upper()+s3[0].upper())

Submission status: Accepted

Solution code:

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

ans = ""

for i in s:
    ans += i[0].upper()

print (ans)

Submission status: Accepted

Solution code:
s1, s2, s3 = (x for x in input().split())
s = s1[0]+s2[0]+s3[0]
print(s.upper())

Submission status: Accepted

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

print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:

x, y, z = input().split()

s = x[0] + y[0] + z[0]

print(s.upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = map(str, input().split())
print(s1.upper()[0]+s2.upper()[0]+s3.upper()[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(s: "List[str]"):
    ret = (s[0][0] + s[1][0] + s[2][0]).upper()
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    s = [ next(tokens) for _ in range(3) ]  # type: "List[str]"
    solve(s)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print((a[0]+b[0]+c[0]).upper())

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
t = ''
t += a[0].upper() + b[0].upper() + c[0].upper()
print(t)

Submission status: Accepted

Solution code:
s1,s2,s3 = list(input().split())
print(''.join([list(s1)[0],list(s2)[0],list(s3)[0]]).upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1, s2, s3 = map(list, input().split())

print(s1[0].upper() + s2[0].upper() + s3[0].upper())

Submission status: Accepted

Solution code:
# A問題
a, b, c = map(str, input().split())
a = a.capitalize()
b = b.capitalize()
c = c.capitalize()
print(a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
s1,s2,s3=map(str, input().split())
s1 =s1.upper()
s2 =s2.upper()
s3 =s3.upper()
print(s1[0],s2[0],s3[0],sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = (input().split())
print((x[:1]+y[:1]+z[:1]).upper())

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

s1, s2, s3 = sl()
print(s1[0].upper() + s2[0].upper() + s3[0].upper())

Submission status: Accepted

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

print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

Solution code:
a, b, c = input().split()
print(a.upper()[0], b.upper()[0], c.upper()[0], sep='')

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split())
K = (a[0]+b[0]+c[0])
print(K.upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = list(input().split(' '))
#print(s1,s2,s3)
                  
word = s1[0]+s2[0]+s3[0]
print(word.upper())

Submission status: Accepted

Solution code:
A,B,C=input().split()
print(''.join((A[0],B[0],C[0])).upper())

Submission status: Accepted

Solution code:
a, b, c = input().split()
d = a[0]+b[0]+c[0]
print(d.upper())

Submission status: Accepted

Solution code:
s1,s2,s3=map(str,input().split())
S=s1[0]+s2[0]+s3[0]
print(S.upper())

Submission status: Accepted

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

# print(s1[0].upper())
# print(s2[0].upper())
# print(s3[0].upper())

print((s1[0] + s2[0] + s3[0]).upper())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(s[0][0].upper()+s[1][0].upper()+s[2][0].upper())

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

input_list = input().split(" ")
input_len = len(input_list)
output = []

for i in range(input_len):
    output.append((input_list[i])[0].upper())
    print(output[i], end="")

Submission status: Accepted

Solution code:
S1, S2, S3 = tuple(input().split())
ans = []
ans.append(S1[0])
ans.append(S2[0])
ans.append(S3[0])
print(''.join(ans).upper())

Submission status: Accepted

Solution code:
s = input().split()
for i in s:
    print(i[0].upper(),end="")

Submission status: Accepted

Solution code:
s_1, s_2, s_3 = input().split()
ans = s_1[0].upper() + s_2[0].upper() + s_3[0].upper()
print(ans)

Submission status: Accepted

Solution code:
def abc():
    s1, s2, s3 = input().split()
    s = s1[0] + s2[0] + s3[0]
    print(s.upper())


abc()

Submission status: Accepted

Solution code:
lst=[str(i) for i in input().split()]
ans=''
for i in lst:
  ans+=i[0].capitalize()
print(ans)

Submission status: Accepted

Solution code:
a,b,c=input().split()
X=a[0]+b[0]+c[0]
print(X.upper())

Submission status: Accepted

Solution code:
S = input().split()
print("".join(s[0].upper() for s in S))

Submission status: Accepted

Solution code:
s1, s2, s3 = map(str, input().split())

print(s1[0].upper() + s2[0].upper() + s3[0].upper())

Submission status: Accepted

Solution code:
x, y, z = map(str, input().split())
print("{0}{1}{2}".format(x.upper()[0], y.upper()[0], z.upper()[0]))

Submission status: Accepted

Solution code:
a, b, c = input().split()
w = a[0] + b[0] + c[0]
print(w.upper())

Submission status: Accepted

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

a ,b ,c = input().split()
ans = a[0]+b[0]+c[0]
print(ans.upper())

Submission status: Accepted

Solution code:
a,b,c = list(input().split(" "))
print((a[0:1]+b[0:1]+c[0:1]).upper())

Submission status: Accepted

Solution code:
A, B, C = [x for x in input().split()]
print(A[0].upper() + B[0].upper() + C[0].upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split()
ans = str(chr(ord(s1[0])-32)) + str(chr(ord(s2[0])-32)) + str(chr(ord(s3[0])-32))
print(ans)

Submission status: Accepted

Solution code:
s,t,u=input().split()
print((s[0]+t[0]+u[0]).upper())

Submission status: Accepted

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

ls = [a[0].upper(),b[0].upper(),c[0].upper()]
print("".join(ls))

Submission status: Accepted

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

print(str.upper(word[0][0]) + str.upper(word[1][0]) + str.upper(word[2][0]))

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split(' ')

print(''.join([s1[0], s2[0], s3[0]]).upper())

Submission status: Accepted

Solution code:
s = [i for i in map(str,input().split())]

S = [(s[i][0]).upper() for i in range(3)]
print(''.join(S))

Submission status: Accepted

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

A = a.upper()
B = b.upper()
C = c.upper()

print(A[0]+B[0]+C[0])

Submission status: Accepted

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

ans = a[0] + b[0] + c[0]

print(ans.upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = [ v for v in input().split() ]
print(s1[0].upper()+s2[0].upper()+s3[0].upper())

Submission status: Accepted

Solution code:
A,B,C = map(str,input().split(' '))
a = A[0].upper()
b = B[0].upper()
c = C[0].upper()
print(a+b+c)

Submission status: Accepted

Solution code:
a, b, c = raw_input().split()
d = ""
d = a[0] + b[0] + c[0]
print d.upper()

Submission status: Accepted

Solution code:
s,t,u = input().split()
print(s[0].upper()+t[0].upper()+u[0].upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = map(str, input().split())
print((s1[0]+s2[0]+s3[0]).upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = input().split(' ')

print(s1[0].upper() + s2[0].upper() + s3[0].upper())

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(chr(ord(a[0])-32),end="")
print(chr(ord(b[0])-32),end="")
print(chr(ord(c[0])-32),end="")

Submission status: Accepted

Solution code:
# 入力
# スペース区切りの整数の入力(未知数)
list_string = [string for string in input().split()]

# 計算
s = ""
for word in list_string :
    s += word[0:1]

# 出力
print(s.upper())

Submission status: Accepted

Solution code:
s1,s2,s3 = input().split()
a = list(s1)
b = list(s2)
c = list(s3)
list = []
list = list + [a[0],b[0],c[0]]
moji = "".join(list)
print(moji.upper())

Submission status: Accepted

Solution code:
a,b,c = input().split()
print((a[0] + b[0] + c[0]).upper())

Submission status: Accepted

Solution code:
s1,s2,s3=input().split()
print(s1[0:1].upper()+s2[0:1].upper()+s3[0:1].upper())

Submission status: Accepted

Solution code:
a, b, c = input().upper().split()
print(a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
a,b,c=input().split()
S=(a[0]+b[0]+c[0]).upper()
print(S)

Submission status: Accepted

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

print(''.join([l[0][0].upper(), l[1][0].upper(), l[2][0].upper()]))

Submission status: Accepted

Solution code:
a, b, c = input().split()
s = a[0] + b[0] + c[0]
print(s.upper())

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

s = [str(i) for i in input().split()]

ans = ""
for i in range(3):
    ans += s[i][0]

print(ans.upper())

Submission status: Accepted

Solution code:
s=[str(i) for i in input().split()]
a=[]
for i in range(3):
    a.append(s[i][0].upper())
print(''.join(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = input().split()
abc = a[0:1] + b[0:1] + c[0:1]
ABC = abc.upper()
print(ABC);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split())
A=a.upper()
B=b.upper()
C=c.upper()
print(A[0]+B[0]+C[0])

Submission status: Accepted

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

A = a.capitalize()

B = b.capitalize()

C = c.capitalize()

print(A[0] + B[0] + C[0])

Submission status: Accepted

Solution code:
a,b,c= input().split()
str = a[0] + b[0] + c[0]
print(str.upper())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())
ans = a[0]+b[0]+c[0]
print(ans.upper())

Submission status: Accepted

Solution code:
a,b,c = list(map(str,input().split()))
d = ""
d = a[0] + b[0] + c[0]
print(d.upper())

Submission status: Accepted

Solution code:
print(str.upper("".join(map(lambda x:x[0],input().split()))))

Submission status: Accepted

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

print(str.upper(a[0]+b[0]+c[0]))

Submission status: Accepted

Solution code:
a,b,c = input().split()
d = a.upper()
e = b.upper()
f = c.upper()
print(d[0]+e[0]+f[0])

Submission status: Accepted

Solution code:
print(''.join(map(lambda x:x[0].upper(),input().split(" "))))

Submission status: Accepted

Solution code:
A, B, C = map(str, input().split())
print((A[0]+B[0]+C[0]).upper())

Submission status: Accepted

Solution code:
a,b,c = input().split()
print(str.upper(a[0]) + str.upper(b[0]) + str.upper(c[0]))

Submission status: Accepted

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

A = a[0].upper()
B = b[0].upper()
C = c[0].upper()

print("{}{}{}".format(A,B,C))

Submission status: Accepted

Solution code:
s1,s2,s3=input().split()
print((s1.capitalize())[0] + (s2.capitalize())[0] + (s3.capitalize())[0])

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(a[0].upper()+b[0].upper()+c[0].upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1,s2,s3 = map(str,input().split())
lists = [s1[0],s2[0],s3[0]]
str_lists = "".join(lists)
print(str_lists.upper())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1, s2, s3 = map(str, input().split())
print('{}{}{}'.format(s1[0].upper(),s2[0].upper(),s3[0].upper()))

Submission status: Accepted

Solution code:
def read_input():
    s = input().strip().split()
    return s

def submit():
    s = read_input()
    s = [w[0].upper() for w in s]

    print(''.join(s))


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a  = ''.join(map(lambda x:chr(ord(x[0])-32),input().split()))

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input().split()
word = a[0] + b[0] + c[0]
print(word.upper())

Submission status: Accepted

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

print((a[0] + b[0] + c[0]).upper())

Submission status: Accepted

Solution code:
import sys
a,b,c = list(input().split())
a = a.capitalize()
b = b.capitalize()
c = c.capitalize()
print(a[0] + b[0] + c[0])

Submission status: Accepted

Solution code:
A, B, C = input().split()
s = A[0] + B[0] + C[0]
print(s.upper())

Submission status: Accepted

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

Submission status: Accepted

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

print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

Solution code:
S0,S1,S2=input().split()
print(S0[0].upper()+S1[0].upper()+S2[0].upper())

Submission status: Accepted

Solution code:
s1, s2, s3 = map(str, input().split())

t1 = s1.upper()
t2 = s2.upper()
t3 = s3.upper()

ans = t1[0] + t2[0] + t3[0]

print(ans)