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

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

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

print(s.upper())

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

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

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

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

print(str)

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

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):
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())

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

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

print(a + b + c)

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

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

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

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

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

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

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

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

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

ans = a1+b1+c1

print(ans.upper())

Solution (Python):
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()

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

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

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

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

Solution (Python):
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)))

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

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

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

Solution (Python):
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]))

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

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

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

print(x.upper())

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

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

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

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

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

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

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

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

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

S1=s1.upper()
S2=s2.upper()
S3=s3.upper()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def resolve():
    S1, S2, S3 = input().split()
    print(str.upper(S1[0]+S2[0]+S3[0]))
resolve()

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

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

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

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

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

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

Solution (Python):
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))

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

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

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

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

print(answer.upper())

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = input().split()
    print(a[0].upper() + b[0].upper() + c[0].upper())


if __name__ == "__main__":
    main()

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
s=list(input().split())
sNew = list(map(lambda x: x[0].upper(),s))
print("".join(sNew))

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

A, B, C = input().split()

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

s = list(read().decode().split())
ans = (s[0][0] + s[1][0] + s[2][0]).upper()
print(ans)

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

Solution (Python):
a, b, c=input().split()
A=a.upper()
B=b.upper()
C=c.upper()

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

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

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

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

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

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

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

Solution (Python):
ans = ''.join([s[0].upper() for s in input().split()])

print(ans)

Solution (Python):
def main():
  num = list(map(str,input().split()))
  print(num[0][0].upper()+num[1][0].upper()+num[2][0].upper())
main()

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

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

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

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

print(''.join([i[0].upper() for i in rs_()]))

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

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

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

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

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

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

print(x.upper())

Solution (Python):
S = list(map(str,input().split()))
ans = ''
for s in S:
    ans += chr(ord(s[0])-32)
print(ans)

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

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

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

Solution (Python):
s = list(input().split())
ans = []
for i in s:
    ans.append(i[:1])
print(''.join(ans).upper())

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

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

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

print(s1[0].upper(), end="")
print(s2[0].upper(), end="")
print(s3[0].upper(), end="")

Solution (Python):

"""
Created on Thu May 14 16:32:08 2020

@author: shinba
"""

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

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

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
a,b,c = input().split(' ')
dif = ord('A') -ord('a')
print(chr((ord(a[0]) + dif))
      ,chr((ord(b[0]) + dif))
      ,chr((ord(c[0]) + dif))
      , sep='')

Solution (Python):
a,b,c = input().split(' ')
print(chr((ord(a[0]) + (ord('A') -ord('a'))))
      ,chr((ord(b[0]) + (ord('A') -ord('a'))))
      ,chr((ord(c[0]) + (ord('A') -ord('a'))))
      , sep='')

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





l = inputSL()

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

Solution (Python):

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

Solution (Python):
import sys
import math
import bisect

def main():
    A = input().split()
    ans = []
    for a in A:
        ans.append(a[0].upper())
    print(''.join(ans))

if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math
import bisect

def main():
    A = input().split()
    ans = []
    for a in A:
        ans.append(a[0].upper())
    print(''.join(ans))

if __name__ == "__main__":
    main()

Solution (Python):
s = list(map(str,input().split()))
ans = []
ans.append(s[0][0].upper())
ans.append(s[1][0].upper())
ans.append(s[2][0].upper())
print(''.join(ans))

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

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

Solution (Python):
s=list(input().split())
L=list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
l=list('abcdefghijklmnopqrstuvwxyz')
ans=''
for i in s:
    ans= ans+L[l.index(i[0])]
print(ans)

Solution (Python):
row1, row2, row3 = input().split()

row1 = row1.upper()
row2 = row2.upper()
row3 = row3.upper()

print(row1[0] + row2[0] + row3[0])

Solution (Python):
s_list = list(input().split())
ans = ""
for i in range(3):
    ans += s_list[i][0].upper()
print(ans)

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

Solution (Python):

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

if __name__ == '__main__':

    ABC_59_A()

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

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

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

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

Solution (Python):

if __name__ == "__main__":
    S = input().split()
    print((S[0][0] + S[1][0] + S[2][0]).upper())

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

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

Solution (Python):
def main():
    a,b,c = (input().split())
    print('{}{}{}'.format(a[0],b[0],c[0]).upper())

if __name__ == '__main__':
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(str, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
S = LIST()

for i in range(3):
	print(S[i][0].upper(), end="")

print()

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

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

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

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

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

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

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

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

Solution (Python):
a = input().split()
ans = []
for i in range(len(a)):
    b = chr(ord(a[i][0])-32)
    ans.append(b)
print(''.join(ans))

Solution (Python):
l = list(map(str, input().split()))

str = l[0][0]+ l[1][0] + l[2][0]

print(str.upper())

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

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

Solution (Python):
ls = list(str(s) for s in input().split())
ans = []
for s in ls:
  ans.append(s[0].upper())
print("".join(ans))

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

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

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

Solution (Python):


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

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

Solution (Python):
s_list = list(input().split())

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

string = ''
for s in s_list:
    idx = ascii_lowercase.find(s[0])
    string += ascii_uppercase[idx]

print(string)

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

Solution (Python):
print(*map(lambda x: x[0].upper(), input().split()), sep="")

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

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

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

print(w.upper())

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

Solution (Python):
s1,s2,s3 = input().split()
S1 = str.upper(s1)
S2 = str.upper(s2)
S3 = str.upper(s3)
print(S1[0]+S2[0]+S3[0])

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

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

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

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

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

a = s1[0].upper()
b = s2[0].upper()
c = s3[0].upper()

print(a,b,c,sep='')

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

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

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

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

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

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

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

Solution (Python):
a,b,c=map(str,input().split())
print(chr(ord(a[0])-32)+chr(ord(b[0])-32)+chr(ord(c[0])-32))

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

L=input().rstrip().split(" ")
s=str.upper(L[0][0])+str.upper(L[1][0])+str.upper(L[2][0])
print(s)

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

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

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

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

print(ans.upper())

Solution (Python):

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


if '__main__' == __name__:
    resolve()

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

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

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

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

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

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

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

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

Solution (Python):
print(*[s[0].upper() for s in input().split()], sep='')

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

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

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

Solution (Python):
def resolve():
	ans = ''
	for i in input().split():
		ans += i[0].upper()
	print(ans)
resolve()

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

S1 = []
for _ in s1:
  S1.append(_)
S2 = []
for _ in s2:
  S2.append(_)
S3 = []
for _ in s3:
  S3.append(_)
  
ans = S1[0]+S2[0]+S3[0]
print(str.upper(ans))

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


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

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

Solution (Python):
s = input()
a = s.rstrip().split()
a1 = a[0].upper()
a2 = a[1].upper()
a3 = a[2].upper()

print(a1[0]+a2[0]+a3[0])

Solution (Python):
s = list(input().split())

for i in range(3):
    print(s[i][0].upper(), end = "")
print()

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

Solution (Python):
li = input().split()

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

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

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

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

Solution (Python):
s1, s2, s3 = map(str, input().split())
S1_ord = ord(s1[0])-32
S2_ord = ord(s2[0])-32
S3_ord = ord(s3[0])-32

S1_chr = chr(S1_ord)
S2_chr = chr(S2_ord)
S3_chr = chr(S3_ord)
print(S1_chr + S2_chr + S3_chr)

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

Solution (Python):
s, t, u = input().split()

print((s[0] + t[0] + u[0]).upper())

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

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

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

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

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

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

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

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

Solution (Python):
m= input()
m=m.upper()
a,b,c = m.split()

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

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

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

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

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

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

Solution (Python):
s1,s2,s3 = input().split()
S1 = s1[0].upper()
S2 = s2[0].upper()
S3 = s3[0].upper()
print(S1+S2+S3)

Solution (Python):
a,b,c=map(str,input().split())
ans=[]
a=a.upper()
b=b.upper()
c=c.upper()
ans.append(a[0])
ans.append(b[0])
ans.append(c[0])
ans=''.join(ans)
print(ans)

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

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

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

Solution (Python):
s1,s2,s3=input().split()
S1=s1.upper()
S2=s2.upper()
S3=s3.upper()

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Solution (Python):
S = input().split()

ans = []
for s in S:
    ans.append(s[0].upper())

print(''.join(ans))

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

for i in range(len(s)):
    st=chr(ord(s[i][0])-32)
    print(st,end="")

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

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

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

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

Solution (Python):
S=list(input().split())
ans=""
for i in range(3):
    ans+=chr(ord(S[i][0])-32)
print(ans)

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

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

Solution (Python):
A, B, C= input().split()

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

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

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