#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define nl "\n"
#define vi vector<int>
#define vs vector<string>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define allr(vec) vec.rbegin(), vec.rend()
#define vi vector<int>
#define mod1 1000000007
#define mod2 998244353
#define sahi(vec) sort(vec.begin(),vec.end())
#define ulta(vec) sort(vec.begin(),vec.end(),greater<typename decltype(vec)::value_type>())
#define fori(a,b) for(int i=a;i<b;i++)
#define forr(a,b) for(int r=a;r>=b;r--)
#define gcd(a,b) __gcd(a,b)
#define popcount(a) __builtin_popcountll(unsigned int)
int lcm(int a,int b) {
    return a/gcd(a,b)*b;
}
bool isPowerOfTwo(unsigned int n) {
    return n&&!(n&(n-1));
}
bool isprime(int n) {
    if(n<2)	return false;
    if(n==2 || n==3)	return true;
    if(n%2==0 || n%3==0)	return false;
    for(int i=5;i*i<=n;i++)
    {
        if(n%i==0 || n%(i+2)==0)
            return false;
    }
    return true;
}
vector<int> sieve(int n) {
    vector<bool> isPrime(n + 1, true);
    vector<int> primes;
    isPrime[0]=isPrime[1]=false;
    for(int i=2;i*i<=n;i++) {
        if(isPrime[i]){
            for(int j=i*i;j<=n;j+=i) {
                isPrime[j]=false;
            }
        }
    }
    for(int i=2;i<=n;i++) {
        if(isPrime[i])primes.push_back(i);
    }
    return primes;
}
vector<long long> primefactorization(long long n) {
    vector<long long> factorization;
    while(n%2==0){
        factorization.push_back(2);
        n/=2;
    }
    for(long long d=3;d*d<=n;d+=2) {
        while(n%d==0){
            factorization.push_back(d);
            n/=d;
        }
    }
    if(n>1)
        factorization.push_back(n);
    return factorization;
}
/*

*/
void solve(){
	string a,b,c;
	cin >> a >> b >> c;
	char d=toupper(a[0]);
	char e=toupper(b[0]);
	char f=toupper(c[0]);
	cout << d << e << f << "\n";
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int t=1;
    //cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}