Problem:


Score : 100 points

Problem Statement

Snuke is going to open a contest named "AtCoder s Contest".
Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.

Snuke has decided to abbreviate the name of the contest as "AxC".
Here, x is the uppercase English letter at the beginning of s.

Given the name of the contest, print the abbreviation of the name.

Constraints

The length of s is between 1 and 100, inclusive.

The first character in s is an uppercase English letter.

The second and subsequent characters in s are lowercase English letters.

Input

The input is given from Standard Input in the following format:

AtCoder s Contest

Output

Print the abbreviation of the name of the contest.

Sample Input 1

AtCoder Beginner Contest

Sample Output 1

ABC

The contest in which you are participating now.

Sample Input 2

AtCoder Snuke Contest

Sample Output 2

ASC

This contest does not actually exist.

Sample Input 3

AtCoder X Contest

Sample Output 3

AXC



Sample input:
AtCoder Beginner Contest


Sample output:
ABC

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, x, c = input().split()
print('A' + x[0] + 'C')

Submission status: Accepted

Solution code:
def solve():
    print('A'+input()[8]+'C')


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()
print("A"+x[8]+"C")

Submission status: Accepted

Solution code:
x = input()[8]
print("A"+x+"C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#48
S=input().split()
s=S[1]
rev_s=list(s)
print('A'+rev_s[0]+'C')

Submission status: Accepted

Solution code:
s = input().split()
print(f"A{s[1][0]}C")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print('A' + b[0] + 'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(f'A{input()[8]}C')

Submission status: Accepted

Solution code:
print(*[i[0] for i in input().split()],sep='')

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    print('A' + s[8] + 'C')

main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def main():
    _, s, _ = input().split()
    print("A{}C".format(s[0]))




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print('A' + input().split()[1][0] + 'C')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AtCoder, s, Contest = input().split()
print(AtCoder[0] + s[0] + Contest[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
title = input().split(" ")
name = title[1]
fst = list(name)
print("A"+fst[0]+"C")

Submission status: Accepted

Solution code:
s = input()
print("A" + s[8] + "C")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s,t = map(str,input().split())
print("A"+s[0]+"C")

Submission status: Accepted

Solution code:
s=input()
print("A"+s[8]+"C")

Submission status: Accepted

Solution code:
#
# abc048 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 = """AtCoder Snuke Contest"""
        output = """ASC"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """AtCoder X Contest"""
        output = """AXC"""
        self.assertIO(input, output)


def resolve():
    S = list(input().split())

    print("A"+S[1][0]+"C")


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

Submission status: Accepted

Solution code:
S = input()
print("A"+S[8]+"C")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
strs = s.split(' ')
c = strs[1][0].upper()

ans = "{}{}{}".format(strs[0][0], c, strs[2][0])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
print("A", s[1][0], "C", sep="")

Submission status: Accepted

Solution code:
a,b,c=input().split()
x=b[0]
A=[]
A.append('A')
A.append(x)
A.append('C')
print(''.join(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from time import perf_counter

import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7

s = input()
print(f"A{s[8].upper()}C ")

Submission status: Accepted

Solution code:
s = input()
print("A" + s[8] + "C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from time import perf_counter

import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7

# import sys
# sys.stdout = open("e:/python/cp/output.txt","w")
# sys.stdin = open("e:/python/cp/input.txt","r")

s = input()
print(f"A{s[8].upper()}C")

Submission status: Accepted

Solution code:
from sys import stdin, stdout
from time import perf_counter

import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7

# import sys
# sys.stdout = open("e:/python/cp/output.txt","w")
# sys.stdin = open("e:/python/cp/input.txt","r")



s = input()
# print(F"Atcoder {s.title()} Contest")

# print(f"A{s[0].upper()}C ")
print(f"A{s[8].upper()}C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ss=s[8]
print("A"+ss+"C")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('A' + s[1][0] + 'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("A" + input()[8] + "C")

Submission status: Accepted

Solution code:
s = input()
print("A"+s[8]+"C")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
sentence = input()
new_sent = sentence.split(" ")
acro = ""
for i in new_sent:
  acro += i[0]
print(acro)

Submission status: Accepted

Solution code:
a = input()
b = a.split()
x = b[1]
y = x[0]
print("A", y, "C", sep = '')

Submission status: Accepted

Solution code:
print('A'+input()[8]+'C')

Submission status: Accepted

Solution code:
# A - AtCoder *** Contest
def main():
    _, s, _ = input().split()

    print('A{0}C'.format(s[0]))
            

if __name__ ==  "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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, x, B = input().split()
    ans = A[0] + x[0] + B[0]
    print(ans.upper())



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = [x for x in input().split()]
ans = L[0][0] + L[1][0] + L[2][0]
print(ans)

Submission status: Accepted

Solution code:
_,s,_=input().split()
print(f'A{s[0].upper()}C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AtCoder,s,Contest = map(str, input().split())
w = 'A' + str(s[0]) + 'C'
print(w)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

x_list=list(x)
x_1=x_list[8]

print("".join(['A',x_1,'C']))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
s = input().split()
print(s[0][0] + s[1][0] + s[2][0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/08/09
# AtCoder Beginner Contest 048 - A

# Input
s = input().split()

# Calc
ans = 'A' + s[1][0] + 'C'

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().split()
print(S[0][0] + S[1][0] + S[2][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 product, combinations,permutations
from copy import deepcopy, copy
from math import sqrt, log10
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    A, X, C = list(input().split())

    print('A'+X[0]+'C')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print(s[0]+s[8]+s[-7])

Submission status: Accepted

Solution code:
s = input()
print('A{}C'.format(s.split()[1][0].upper()))

Submission status: Accepted

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

print("A"+s[0]+"C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_, s, _ = input().split()
print("A{}C".format(s[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,s,b = map(str, input().split())

print("A"+s[0]+"C")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print("A"+input()[8]+"C")

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    _, s, _ = LSS()    

    print('A' + s[0] + 'C')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a, b, c = map(str,input().split())
print(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] )

Submission status: Accepted

Solution code:
s = input()
 
print("A"+s[8]+"C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AtCoder, s, Contest = input().split()

s = s[0]
ans = 'A'+ s + 'C'
print(ans)

Submission status: Accepted

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

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)

A, s, C = input().split()
print(''.join([A[0], s[0], C[0]]))

Submission status: Accepted

Solution code:
S = input().split()
ans = f'A{S[1][0]}C'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,x,b=input().split()
print("A"+x[0]+"C")

Submission status: Accepted

Solution code:
print(f'A{input().split()[1][0]}C')

Submission status: Accepted

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

main()

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 product, combinations,permutations
from copy import deepcopy
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    a, s, c = map(str, input().split())
    print('A'+s[0]+'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyは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,pi,factorial
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)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

lis=input().rstrip().split(" ")
print("A"+lis[1][0]+"C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(str,input().split()))
v = ''
for i in range(len(l)):
    v = v + l[i][0]
print(v)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import deepcopy
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools
import copy


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


def gcd(a, b):
    while(b != 0):
        a, b = b, a % b
    return a


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
s = list(map(str, input().split()))
# print(s)
tmp = []
for i in range(3):
    tmp.append(s[i][0])
print(''.join(tmp))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print('A'+s[8]+'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
at, b, co= input().split()
print('A'+b[0]+'C')

Submission status: Accepted

Solution code:
a, s, c = input().split()
print('A'+s[0]+'C')

Submission status: Accepted

Solution code:
l = input().replace(' ','')
print(l[0]+l[7]+l[-7])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=list(input().split())
index=inp[1][0]
print("A"+index+"C")

Submission status: Accepted

Solution code:
a = list(map(str,input().split()))
x = a[1]
print("A"+ x[0] + "C")

Submission status: Accepted

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

print(ll[0][0:1],ll[1][0:1],ll[2][0:1], sep='')

Submission status: Accepted

Solution code:
#AtCoder s Contest
a, s, c = map(str, input().split())

print("A" + s[0] + "C")

Submission status: Accepted

Solution code:
print(f"A{input()[8]}C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ans=['A']
ans.append(s[8])
ans.append('C')
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print(f"A{s[8]}C")

Submission status: Accepted

Solution code:
s=input()
print("A"+s[8]+"C")

Submission status: Accepted

Solution code:
print('A'+input()[8].upper()+'C')

Submission status: Accepted

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

Submission status: Accepted

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

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

a,b,c = S()
print('A'+b[0]+'C')

Submission status: Accepted

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

def main():

    name = input()

    ans = name.split()

    print(ans[0][0] + ans[1][0] + ans[2][0])


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_,s,_=input().split()
print(f'A{s[0]}C')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
s=s.split()
d=s[1][0]
print('A'+d+'C')

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def abc048():
    d=[]
    a=input()
    b=a.split()
    c=[i for i in b]
    k=''.join(c)
    for i in k:
        d.append(i)

    print(d[0],end='')
    print(d[len(c[0])],end='')
    print('C',end='')
    


abc048()

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" + b[0] + "C"
    print(ans)

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# その3 ABC048 A - AtCoder *** Contest

s = str(input())
print('A'+s[8]+'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("A" + input().split()[1][0] + "C")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def LS2(): 
    return list(sys.stdin.readline().rstrip())  #空白なし

print('A'+LS2()[8]+'C')

Submission status: Accepted

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

res = "A" + S[1][0] + "C"
print(res)

Submission status: Accepted

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

a=l[1]
b=a[0:1]
print("A"+b+"C")

Submission status: Accepted

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

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, x, c = M()
print('A' + x[0] + 'C')

Submission status: Accepted

Solution code:
a,s,c=input().split()
 
print('A{}C'.format(s[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,x,C = input ().split ()
n = x[:1]
print ('A'+n+'C')

Submission status: Accepted

Solution code:
Atcorder,s,Contest=map(str,input().split())
S=list(s)
print('A'+S[0]+'C')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('A'+s[0].upper()+'C')

Submission status: Accepted

Solution code:
Array = list(input().split())
tmp = Array[1]
print("A" + tmp[:1] + "C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input().split())
print("{}{}{}".format(l[0][0],l[1][0],l[2][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])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('A{}C'.format(s[0]))

Submission status: Accepted

Solution code:
N = list(input().split())
S = N[1]
print("A"+S[0]+"C")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s,c = input().split()
print("A"+s[0]+"C")

Submission status: Accepted

Solution code:
print('A'+str(input())[8]+'C')

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

#出力
print('A', lst[1][0], 'C', sep='')

Submission status: Accepted

Solution code:
A = list(input().rstrip().split(" "))
ans = []
for i in A:
    ans.append(i[0])
print("".join(ans))

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	s_list = LS()
	print('A{}C'.format(s_list[1][0]))




if __name__ == '__main__':
    main()

Submission status: Accepted

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

s=name[1][:1]

print('A'+s+'C')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s,c=input().split()
print("A"+s[0]+"C")