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:
a,b,c=input().split()
x=a[0]+b[0]+c[0]
print(x.upper())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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


if __name__ == '__main__':
    main()

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()
print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

Solution code:
print(*map(lambda s: s[0].upper(), input().split()), 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:
a,b,c=input().split()
d = a[0]+b[0]+c[0]
print(str.upper(d))

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:
s1, s2, s3 = map(str, input().split())

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

Submission status: Accepted

Solution code:
a=input().split()
b=[]

for i in range(3):
  b.append(a[i][0].upper())
  
  
print(b[0]+b[1]+b[2])

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:
print("".join(s[0].upper()for s in input().split()))

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())
d=a[0]+b[0]+c[0]
print(d.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:
a, b, c = map(str, input().split())

a = str.capitalize(a)
b = str.capitalize(b)
c = str.capitalize(c)

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

Submission status: Accepted

Solution code:
#
# abc059 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """atcoder beginner contest"""
        output = """ABC"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """resident register number"""
        output = """RRN"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """k nearest neighbor"""
        output = """KNN"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """async layered coding"""
        output = """ALC"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

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:
s_lst = list(map(str, input().split()))
ans = ''
for i in range(3):
    s = s_lst[i]
    ans += s[0]

print(ans.upper())

Submission status: Accepted

Solution code:
l=input().split()
r=''
for i in l:
    r+=i[0].upper()
print(r)

Submission status: Accepted

Solution code:
s = input().split()
x = s[0][0] + s[1][0] + s[2][0]
print(x.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:
s1, s2, s3 = input().split()
print(s1.upper()[0] + s2.upper()[0] + s3.upper()[0])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s1, s2, s3 = map(str, input().split())

print(s1[0].upper() + s2[0].upper() + s3[0].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()
print(A.upper()[0]+B.upper()[0]+C.upper()[0])

Submission status: Accepted

Solution code:
w = input().split()
a = ""
for i in w:
	a += i.upper()[0]
print(a)

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 = list(map(str, input().split()))
print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input().split()
print ''.join([w[0] for w in s]).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:
S = input().split()
print(''.join([s[0].upper() for s in S]))

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()
ans = a[0] + b[0] + c[0]
print(ans.upper())

Submission status: Accepted

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

d = a[0].upper()
e = b[0].upper()
f = c[0].upper()

print(d+e+f)

Submission status: Accepted

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

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:
import sys
def input(): return sys.stdin.readline().strip()

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

if __name__ == "__main__":
    main()

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:
a,b,c=input().split()
A = a.upper()
B = b.upper()
C = c.upper()
print(A[0]+B[0]+C[0])

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=map(str,input().split())
print('{}{}{}'.format(a[0].upper(),b[0].upper(),c[0].upper()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B, C = input().split()
    ans = A[0] + B[0] + C[0]
    print(ans.upper())



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s1,s2,s3 = map(lambda x:x.upper(),input().split())
print(s1[0]+s2[0]+s3[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:
a,b,c =input().split()
print(a[0].upper(),b[0].upper(),c[0].upper(),sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]


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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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()
a=list(a)
b=list(b)
c=list(c)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(input().split())
b=[]
for i in a:
    b.append(i.upper())
print(b[0][0]+b[1][0]+b[2][0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b,c = input().split()

print(a[0:1].upper(),b[0:1].upper(),c[0:1].upper(),sep='')

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()

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

Submission status: Accepted

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

for i in range(3):
    tmp = list(map(str,a[i]))
    b = tmp[0]
    b = chr(ord(b)-32)
    ans.append(b)

print("".join(ans))

Submission status: Accepted

Solution code:
print(''.join([s[0].upper() for s in 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 = map(str,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=""
for x in input().split():s+=x[0]
print(s.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:
s,t,u = map(str,input().split())
print(s[0].upper()+t[0].upper()+u[0].upper())

Submission status: Accepted

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

ans=l[0][0]+l[1][0]+l[2][0]
print(ans.upper())

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    s,t,u = SL()
    x = s[0]+t[0]+u[0]
    print(x.upper())
    exit()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
print((s[0][0] + s[1][0]+s[2][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:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    a, b, c = readline().split()

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
n=a[0]+b[0]+c[0]
print(n.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()
print(a[0].upper(), b[0].upper(), c[0].upper(), sep="")

Submission status: Accepted

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

Submission status: Accepted

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

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:
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[0] + b[0] + c[0]).upper())

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:
a,b,c=map(str,input().split())
res = a[0]+b[0]+c[0]
Res = res.upper()
print(Res)

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:
print(''.join([i[0].upper() for i in input().split()]))

Submission status: Accepted

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

print(chr(ord(s1[0])-32) + chr(ord(s2[0])-32) + chr(ord(s3[0])-32))

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

s1,s2,s3 = S()
print(str.upper(s1[0]+s2[0]+s3[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:
s = input().split()
print((s[0][0] + s[1][0] + s[2][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:
x,y,z = input ().split ()
s = x[0]+y[0]+z[0]
m = s.upper ()
print (m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
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].upper() + b[0].upper() + c[0].upper())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(d.upper())

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:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b, c = M()
x = a[0] + b[0] + c[0]
print(str.upper(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
s = list(map(str,input().split()))
ans = ""
for x in s:
  ans += x[0].upper()
print(ans)

Submission status: Accepted

Solution code:
A, B, C =input().split()
print("{}{}{}".format(A[0], B[0], C[0]).upper())

Submission status: Accepted

Solution code:
a = list(map(str, input().split()))
b= [a[i][0]for i in range(3)]
c= [b[i].upper() for i in range(3)]
print("".join(c))

Submission status: Accepted

Solution code:
#入力
lst = input().split()

#頭文字
letter1 = lst[0][0]
letter2 = lst[1][0]
letter3 = lst[2][0]

#出力
print(letter1.upper(), letter2.upper(), letter3.upper(), sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input().split())
    
a = []
a.append(s[0][0].upper())
a.append(s[1][0].upper())
a.append(s[2][0].upper())
print(*a, sep='')

Submission status: Accepted

Solution code:
print(*[*zip(*input().upper().split())][0],sep='')

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(s.upper())

Submission status: Accepted

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

Submission status: Accepted

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

s1 = s1.swapcase()
s2 = s2.swapcase()
s3 = s3.swapcase()

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

print(str)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a, b, c = map(lambda x : str(x)[0].upper(), input().split())

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

Submission status: Accepted

Solution code:
def actual(a, b, c):
    return f'{a[0]}{b[0]}{c[0]}'.upper()

a, b, c = input().split()
print(actual(a, b, c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for I in S:
    if not I.islower():
        sys.exit()
    if len(I) < 0 or len(I) > 10:
        sys.exit()

result = ""
for J in S:
    result = result + J[0:1]
print(result.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()
a = a[0].upper()
b = b[0].upper()
c = c[0].upper()

print(a + b + c)

Submission status: Accepted

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

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:
a, b, c = map(str, input().split())
print((a[0]+b[0]+c[0]).upper())

Submission status: Accepted

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

a1 = a[0]
b1 = b[0]
c1 = c[0]

ans = a1+b1+c1

print(ans.upper())

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s1, s2, s3 = input().split()
    res = s1[0] + s2[0] + s3[0]
    print(res.upper())


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(x.upper())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S1,S2,S3 = input().split()

print((S1[0]+S2[0]+S3[0]).upper())

Submission status: Accepted

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

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()
d = a[0] + b[0] + c[0]
print(d.upper())

Submission status: Accepted

Solution code:
A, B, C = list(map(str, input().split()))
print((chr(-32+ord(A[0])))+(chr(-32+ord(B[0])))+(chr(-32+ord(C[0]))))

Submission status: Accepted

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

Submission status: Accepted

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

result = ""
for i in s:
  result += i[0].upper()
  
print(result)

Submission status: Accepted

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

res = ''
for i in s:
    res += chr(ord(i[0])-0x20)
print(res)

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(str.upper(s1[0]+s2[0]+s3[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
def resolve():
    S1, S2, S3 = input().split()
    print(str.upper(S1[0]+S2[0]+S3[0]))
resolve()

Submission status: Accepted

Solution code:
s = input().split()
a = s[0][0] + s[1][0] + s[2][0]
print(a.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:
a, b, c = map(str, input().split())
s = a[0].upper() + b[0].upper() + c[0].upper()
print(s)

Submission status: Accepted

Solution code:
a=list(input().split())
b=[]
for i in a:
    b.append(i.upper())
print(b[0][0]+b[1][0]+b[2][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:
a, b, c = input().split()

la = list(a)
lb = list(b)
lc = list(c)

ans1 = la[0]+lb[0]+lc[0]
print(str.upper(ans1))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer.upper())